#include <stdio.h>
#include<cstring>
using namespace std;
const int MAXN=10000;
int prime[MAXN+1];
void getPrime()
{ memset(prime,0,sizeof(prime)); for(int i=2; i<=MAXN; i++) { if(!prime[i]) prime[++prime[0]]=i; for(int j=1; j<=prime[0]&&prime[j]<=MAXN/i; j++) { prime[prime[j]*i]=1; if(i%prime[j]==0) break; } }
}
long long factor[100][2];
int fatCnt;
int getFactors(long long x)
{ fatCnt=0; long long tmp=x; for(int i=1; prime[i]<=tmp/prime[i]; i++) { factor[fatCnt][1]=0; if(tmp%prime[i]==0) { factor[fatCnt][0]=prime[i]; while(tmp%prime[i]==0) { factor[fatCnt][1]++; tmp/=prime[i]; } fatCnt++; } } if(tmp!=1) { factor[fatCnt][0]=tmp; factor[fatCnt++][1]=1; } return fatCnt;
} int n,k;
long long euler[40001];
void getEuler()
{ memset(euler,0,sizeof(euler)); euler[1] = 1; for(int i = 2; i <= 40000; i++) if(!euler[i]) //i是素数 for(int j = i; j <= 40000; j += i) { if(!euler[j]) euler[j] = j; euler[j] = euler[j]/i*(i-1); }
}
int gcd(int a,int b)
{ if(a==0) return b; return gcd(b%a,a);
}
int main()
{ getPrime(); getEuler(); while(scanf("%d%d",&n,&k)!=EOF) { getFactors(n); long long ret = n; for(int i = 0; i < fatCnt; i++) { ret = ret/factor[i][0]*(factor[i][0]-1); } long long ans=(ret*2)%1000000007; if(k>2) puts("0"); else if(k==2) puts("1"); else if(k==1) { int i; for(i=2; i*i<n; i++) { if(n%i==0) { //printf("%d %d\n",i,n/i); //printf("%d %d\n",n/i,i); ans+=ret*euler[gcd(i,n/i)]/gcd(i,n/i)*2; if(ans>1000000007) ans%=1000000007; } } if(i*i==n) { if(n%i==0) { //printf("%d %d\n",i,n/i); ans+=ret*euler[gcd(i,n/i)]/gcd(i,n/i); if(ans>1000000007) ans%=1000000007; } } //ans++;ans%=1000000007; printf("%lld\n",ans); } } return 0;
}