#include <bits/stdc++.h>
using namespace std;
long long x, n, ans;
vector<long long> v;
void prime(long long x) {
  long long st = 2;
  long long x1 = x, x2 = sqrt(x) + 1;
  while (x) {
    if (x % st == 0) {
      if (st != x1) {
        v.push_back(st);
        if (x / st == st) {
          return;
        }
      }
      while (x % st == 0) {
        x /= st;
      }
    }
    ++st;
    if (st >= x2) break;
    if (st > x) break;
  }
  if (x > 1) {
    v.push_back(x);
  }
}
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> x >> n;
  prime(x);
  if (v.size() == 0) {
    v.push_back(x);
  }
  ans = 1;
  long long cnt;
  for (int i = 0; i < v.size(); i++) {
    long long temp = 1;
    for (int j = 1; j <= 100; j++) {
      if (temp >= n) {
        if (temp > n) temp /= v[i];
        break;
      }
      if (n / temp < v[i]) break;
      temp *= v[i];
    }
    cnt = 0;
    while (temp > 1) {
      ans = (ans % 1000000007 * power(temp, n / temp - cnt, 1000000007) %
             1000000007) %
            1000000007;
      cnt = n / temp;
      temp /= v[i];
    }
  }
  cout << ans << "\n";
}
