//UVA11440HelpMr.Tomisu
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 10000000;
const int MOD = 100000007;
bool vis[maxn + 5];
void sieve(int n) {
for(int i = 2; i <= n; i++)
if(!vis[i])
for(int j = i * 2; j <= n; j += i) vis[j] = true;
}
long long phifac[maxn];
int main() {
int n, m;
sieve(maxn);
phifac[1]/*为了在当m为1时进行计算,赋值为1*/ = phifac[2] = 1;
for(int i = 3; i <= maxn; i++)
phifac[i] = phifac[i - 1] * (vis[i] ? i : (i - 1)) % MOD;
while(scanf("%d%d", &n, &m) == 2 && n) {
long long ans = phifac[m];
for(int i = m + 1; i <= n; i++) ans = ans * i % MOD;
printf("%lld\n", (ans - 1 + MOD) % MOD);//题中为从2开始算,所以要去除1
}
}
/*
100 10
100 20
10000 9000
0 0
*/
UVA11440HelpMr.Tomisu
最新推荐文章于 2020-03-12 11:28:54 发布