#include<bits/stdc++.h>
#define ll long long
using namespace std;
inline ll phi(ll n){
	ll ans=n;
	for(register ll i=2;i*i<=n;++i)
		if(n%i==0){
			ans=ans/i*(i-1);
			while(n%i==0)n/=i;
		}
	if(n^1)ans=ans/n*(n-1);
	return ans;
}
int main(){
	ll n,k;
	cin>>n>>k,
	k=(k+1)/2;
	while(k&&(n^1))n=phi(n),--k;
	cout<<n%((int)1e9+7);return 0;
}