/***********************
author : Meng Xiangcong
***********************///#include <bits/stdc++.h>#include <map>#include <queue>#include <stack>#include <cmath>#include <ctime>#include <string>#include <vector>#include <cstdio>#include <cstdlib>#include <cstring>#include <utility>#include <climits>#include <ctype.h>#include <sstream>#include <iostream>#include <algorithm>#include <functional>usingnamespacestd;
#define PI acos(-1)#define INF (1<<30)#define EPS 1e-6#define SETDATA memset(data, 0, sizeof(data))#define SET(a, b) memset(a, b, sizeof(a))typedeflonglong LL;
//template:#define MOD 1000000007
LL quickPower(LL a, LL b)
{
LL ans = 1;
a %= MOD;
while (b)
{
if (b & 1)
{
ans = ans * a %MOD;
}
b >>= 1;
a = a * a % MOD;
}
return ans;
}
LL c(LL n, LL m)
{
if (m > n)
{
return0;
}
LL ans = 1;
for (int i = 1; i <= m; i++)
{
LL a = (n + i - m) % MOD;
LL b = i % MOD;
ans = ans * (a * quickPower(b, MOD - 2) % MOD) % MOD;
}
return ans;
}
LL lucas(LL n, LL m)
{
if (m == 0)
{
return1;
}
return c(n % MOD, m % MOD) * lucas(n / MOD, m / MOD) % MOD;
}
int main()
{
LL a, b;
while (~scanf("%lld %lld", &a, &b))
{
printf("%lld\n", lucas(a, b)); //输出Cab
}
return0;
}