CMO 1989 Problem 5

Given $1989$ points in the space, any three of them are not collinear. We divide these points into $30$ groups such that the numbers of points in these groups are different from each other. Consider those triangles whose vertices are points belong to three different groups among the $30$ . Determine the numbers of points of each group such that the number of such triangles attains a maximum.