1935 借书方案


Submit solution

Points: 100
Time limit: 1.0s
Memory limit: 32M

Problem types
Allowed languages
C, C++, Java, Python

Description

丽丽有M本不同的书,要借给N个小朋友(N<=M),若每人每次只能借1本,则可以有多少种不同的借法?

Input

一些整数对,每对整数M和N(N<=M,1<=M<=12)。

Output

整数,每个输出占一行。

Sample

Input

5 3
3 2

Output

60
6

Hint

qn


Comments

There are no comments at the moment.