John loves collecting stamps! If he divides the number of stamps he has by $$32$$, then he will have $$30$$ remaining stamps; if he divides the number of stamps he has by $$9$$, he will have $$7$$ remaining stamps; if he divides the number of stamps he has by $$7$$, he will have $$5$$ remaining stamps. How many stamps, at least, does John have? 
Overseas Competition->Knowledge Point->Number Theory Modules->Remainder Problems->Chinese Remainder Theorem
The total number of stamps when divided by $$32$$, $$9$$, and $$7$$ leaves remainders of $$30$$, $$7$$, and $$5$$, respectively. In other words, the number when added by $$2$$ is divisible by $$32$$, $$9$$, and $$7$$. Hence, the smallest such number is $$32\times9\times7-2=2014$$. The answer is $$\rm A$$. 