Binomial Coefficient

Medium#math #combinatorics· solved by 0 · time limit 2.0 s

Print $\binom{n}{k} \bmod (10^9+7)$ — the number of ways to choose $k$ items from $n$ .

Input

Two integers $n$ and $k$ .

$\binom{n}{k} \bmod 1000000007$ .

$0 \le k \le n \le 10^5$

Input

5 2

Output

Input

10 0

Output