Barbarian want some candies as gift from his friend shadix on his birthday. Barbarian demands some $P$ candies from shadix. Shadix has his own shop of $N$ different types of candies. But here comes the famous riddler Pundir and he asks in how many different ways he can give candies to Barbarian.

Assuming there are unlimited amount of candies of each type.

Input
The first line contains $P$ and $N$.

Output
In the output, you need to print the number of ways  for each test case modulo $1000000007$.

Constraints
$1 \le P \le 5000000\\ 1 \le N \le 5000000$