Problem #PRU-105204

Problem

In a mathematical olympiad, $m>1$ candidates solved $n>1$ problems. Each candidate solved a different number of problems to all the others. Each problem was solved by a different number of candidates to all the others. Prove that one of the candidates solved exactly one problem.