#include<bits/stdc++.h>using namespace std;#pragma comment(linker, "/STACK:102400000,102400000")#define rep(i,a,b) for (int i=a;i<=b;i++)#define per(i,b,a) for (int i=b;i>=a;i--)#define mes(a,b)  memset(a,b,sizeof(a))#define INF 0x3f3f3f3f#define MP make_pair#define PB push_back#define fi  first#define se  secondtypedef long long ll;const int N = 200005, mod = 1000000007;ll n, k;ll  phi(ll n){    ll ans=n;    for(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(){    scanf("%lld %lld", &n, &k);    ll cnt=0;    while(n!=1 && cnt<(k+1)/2)    {        ++cnt, n=phi(n);    }    printf("%lld\n", (n+mod)%mod);    return 0;}