#include <iostream>
#include <vector>
#include <string>
#include <iomanip>
#include <queue>
#include <cmath>
#include <algorithm>
#include <tuple>
#include <iomanip>
#include <stdio.h>
#include <numeric>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <queue>

/*
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("section-anchors")
#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
#pragma GCC optimize("vpt")
#pragma GCC optimize("rename-registers")
#pragma GCC optimize("move-loop-invariants")
#pragma GCC optimize("unswitch-loops")
#pragma GCC optimize("function-sections")
#pragma GCC optimize("data-sections")
#pragma GCC optimize("branch-target-load-optimize")
#pragma GCC optimize("branch-target-load-optimize2")
#pragma GCC optimize("btr-bb-exclusive")
*/

#define int long long
#define ll long long
#define ull unsigned long long
#define all(a) a.begin(), a.end()
#define pii pair<int, int>
#define pb push_back
#define ld long double


using namespace std;

const int INF = 1e13;
//const int mod = 2600000069;
//const int p = 179;

const ull mod = 1000000007;

void solve() {

}

long long gcd(long long a, long long b) {
    if (a==0) return b;
    if (b==0) return a;
    if (a>b) return gcd(a%b,b); else return gcd(b%a,a);
}

bool check(int a) {
    vector<bool> was(11, 0);
    while (a != 0) {
        if (was[a % 10]) return 0;
        was[a % 10] = 1;
        a /= 10;
    }
    return 1;
}

ull powmod(ull a, ull b, ull mod) {
    if (a == 1 or b == 0) {if (mod == 1) return 0; else return 1;}
    if (b%2) {ull k = powmod(a,b/2,mod); return ((k*k)%mod*a)%mod;}
    else {ull k = powmod(a,b/2,mod); return (k*k)%mod;}
}

bool prime(ull p) {
    if (p == 1) return 0;
    for (ull i=2;i*i<=p;i++) {
        if (p%i==0 && i<p) return false;
    }
    return true;
}


signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ull n;
    ull x;
    cin >> x >> n;
//    cout << x << " " << n << "\n";
    set<ull> div;
    ull q = x;
//    cout << sqrt(x) << "\n";
    if (prime(q)) {
        div.insert(q);
    } else {
    for (ull i = 2; i*i <= q; i++) {
        if (q % i == 0 && prime(i)) {
            div.insert(i);
        }
    }
    }

//    cout << "here\n";
//    for (auto k : div) cout << k << " ";
//    cout << "\n";
    ull ans = 1;
    ull w;
//    cout << mod * mod << "\n";
    for (auto k : div) {
        w = n/k;
        while (w != 0) {
            ans *= powmod(k, w, mod);
            w/=k;
            ans %= mod;
        }
    }
    cout << ans;
}
/*

*/