IR-TST 2002 Problem 5

A school has $n$ students and $k$ classes. Every two students in the same class are friends. For each two different classes, there are two people from these classes that are not friends. Prove that we can divide students into $n-k+1$ parts taht students in each part are not friends.