#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
void genprimes(vector<long long>& primes, long long x) {
  int trgt = sqrt(x);
  for (int i = 2; i <= trgt; i++) {
    if (x % i == 0) {
      primes.push_back(i);
      while (x % i == 0) {
        x /= i;
      }
    }
  }
  if (x > 1) {
    primes.push_back(x);
  }
}
long long power(long long a, long long b) {
  if (b == 0) {
    return 1;
  }
  if (b == 1) {
    return a;
  } else {
    long long temp = power(a, b / 2);
    temp *= temp;
    temp %= mod;
    if (b % 2) {
      temp *= a;
      temp %= mod;
    }
    return temp;
  }
}
int main() {
  long long x;
  long long n;
  cin >> x >> n;
  vector<long long> factors;
  genprimes(factors, x);
  long long ans = 1;
  for (auto a : factors) {
    vector<long long> numtimes;
    unsigned long long curr = a;
    while (curr <= n && curr > 0) {
      numtimes.push_back(n / curr);
      if (n / curr < a) break;
      curr *= a;
    }
    if (numtimes.size() == 0) continue;
    for (int i = 0; i < numtimes.size() - 1; i++) {
      numtimes[i] -= numtimes[i + 1];
    }
    curr = a;
    for (int i = 0; i < numtimes.size(); i++) {
      ans *= power(curr, (i + 1) * numtimes[i]);
      ans %= mod;
    }
  }
  cout << ans << "\n";
  return 0;
}
