There are n students in a class, and the number of pairs of friends (edges) in the class is m.Prove that there is a non-empty subset of students in which each of them know have at least m friends among themselves.