Deep in the acacia flats of Thornveld, Corwin studies rows of abacus beads entries. One clean number will settle the guild's oldest argument. Task: Print C(n, r) modulo 1000000007. Input format: One line with two integers n and r. Output format: Print the binomial coefficient mod 1000000007. Constraints: 0 <= r <= n <= 4000.
Example 1:
Example 2:
Example 3:
Constraints:
0 <= r <= n <= 4000.
