#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(),(v).end()
#define pb(a) push_back(a)
#define rep(i, n) for(int i=0;i<n;i++)
#define foa(e, v) for(auto& e : v)
using ll = long long;
const ll MOD7 = 1000000007, MOD998 = 998244353, INF = (1LL << 60);
#define dout(a) cout<<fixed<<setprecision(10)<<a<<endl;

vector<ll> p(1000001, -1);

vector<pair<ll, ll>> prime(ll n) {
    vector<pair<ll, ll>> v;
    ll par = -1, num = 0;
    while(n != 1) {
        if(p[n] != par) {
            if(num) v.push_back({par, num});
            num = 0;
        }
        par = p[n];
        num ++;
        n /= p[n];
    }
    if(num) v.push_back({par, num});
    return v;
}
struct Doubling {
private:
    std::vector<std::vector<vector<pair<ll, ll>>>> nx;
public:
    Doubling() noexcept {
        nx.resize(100000, vector (63, vector<pair<ll, ll>> ()));
        for(ll i = 2; i < 100000; i ++) if(p[i] == i) {
            nx[i][0] = prime(i + 1);
        }
        for(int j = 0; j < 62; j ++) for(int i = 0; i < 100000; i ++) if(p[i] == i) {
            map<ll, ll> mp;
            for(auto [x, y] : nx[i][j]) {
                for(auto [x1, y1] : nx[x][j]) {
                    mp[x1] += y * y1;
                    mp[x1] %= MOD7 - 1;
                }
            }
            for(auto P : mp) {
                nx[i][j + 1].push_back(P);
            }
        }
    }
    vector<pair<ll, ll>> par(vector<pair<ll, ll>> now, long long m) {
        for(long long i = 0, j = 1; j <= m; i ++, j <<= 1) {
            if(m & j) {
                map<ll, ll> mp;
                for(auto [x, y] : now) {
                    for(auto [x1, y1] : nx[x][i]) {
                        mp[x1] += y * y1;
                        mp[x1] %= MOD7 - 1;
                    }
                }
                now.clear();
                for(auto P : mp) {
                    now.push_back(P);
                }
            }
        }
        return now;
    }
};
long long modinv(long long a, long long MOD) {
    long long b = MOD, u = 1, v = 0;
    while (b) {
        long long t = a / b;
        a -= t * b; std::swap(a, b);
        u -= t * v; std::swap(u, v);
    }
    u %= MOD; 
    if (u < 0) u += MOD;
    return u;
}

long long modpow(long long a, long long n, long long MOD) {
    long long res = 1;
    a %= MOD;
    if(n < 0) {
        n = -n;
        a = modinv(a, MOD);
    }
    while (n > 0) {
        if (n & 1) res = res * a % MOD;
        a = a * a % MOD;
        n >>= 1;
    }
    return res;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    for(ll i = 2; i <= 1000000; i ++) {
        if(p[i] != -1) continue;
        for(ll j = i; j <= 1000000; j += i) {
            if(p[j] == -1) p[j] = i;
        }
    }
    Doubling D;
    ll n, k;
    cin >> n >> k;

    ll ans = 1;
    for(auto [x, y] : D.par(prime(n), k)) {
        ans *= modpow(x, y, MOD7);
        ans %= MOD7;
    }
    cout << ans << endl;
    return 0;
}