There is a Horrible ghost story: TT robbbed all sweets from all NBUT
ACMers, so she smirked:"Ho-Ho-Ho-Ho, He-He-He-He, Ha-Ha-Ha-Ha~". Then TT had S sweets and T bowls, she wanted to put all sweets in the bowls, she
allowed some bowls empty, so here comes the problem, how many different
ways TT could put these sweets? One more rule, if there are 6 sweets and 3 bowls, she
said 1,2,3 or 2,1,3 or 3,1,2 or 3,2,1 are the same, that means you can't treat these same ways as "different ways".

For each input, output the result in a single line.