Let G is a graph with the vertex denotes a student and edges represent the exchange of cards between any two students. Here number of students n≥1. Let's start with a contradiction that no students has exchanged their cards to each other. So m=0. If m=0 then 1>n which contradicts that n≥1.