
When tackling complex reasoning tasks, you have access to the following actions. Use them as needed to progress through your thought process.

[ASSESS]

[ADVANCE]

[VERIFY]

[SIMPLIFY]

[SYNTHESIZE]

[PIVOT]

[OUTPUT]

You should strictly follow the format below:

[ACTION NAME]

# Your action step 1

# Your action step 2

# Your action step 3

...

Next action: [NEXT ACTION NAME]


system

Given a set of points \( P = \{P_1, P_2, \ldots, P_{1994}\} \) on the plane, where no three points are collinear, divide the points into 83 groups such that each group has at least 3 points, and every point belongs to exactly one group. Then, connect any two points within the same group with a line segment, but do not connect points from different groups. This forms a diagram \( G \). Different ways of grouping the points yield different diagrams. Let \( m(G) \) be the number of triangles formed in the diagram \( G \) using the points from \( P \) as vertices. Find the minimum value of \( m(G) \).

Present the answer in LaTex format: \boxed{Your answer}
user