Problem #PRU-5046

Problems Mathematical logic

Problem

Show the following: Pigeonhole principle strong form: Let q1,q2,...,qn be positive integers. If q1+q2+...+qnn+1 objects are put into n boxes, then either the 1st box contains at least q1 objects, or the 2nd box contains at least q2 objects, . . ., or the nth box contains at least qn objects.
How can you deduce the usual Pigeonhole principle from this statement?