#include <bits/stdc++.h>
using namespace std;
long long int power(long long int t, long long int x) {
  long long int ans = 1;
  while (t > 0) {
    if (t % 2 == 1) ans = (ans * x) % 1000000007;
    t = t / 2;
    x = (x * x) % 1000000007;
  }
  return ans % 1000000007;
}
void prime(long long int n, vector<long long int>& v) {
  map<long long int, long long int> m;
  while (n % 2 == 0) {
    n = n / 2;
    if (m[2] == 0) {
      v.push_back(2);
      m[2] = 1;
    }
  }
  for (long long int i = 3; i * i <= n; i++) {
    while (n % i == 0) {
      if (m[i] == 0) {
        v.push_back(i);
        m[i] = 1;
      }
      n = n / i;
    }
  }
  if (n > 2) v.push_back(n);
}
int main() {
  std::ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int x, n;
  cin >> x >> n;
  vector<long long int> v;
  prime(x, v);
  map<long long int, long long int> p;
  ;
  for (long int i = 0; i < v.size(); i++) {
    long long int m = n;
    while (m >= v[i]) {
      p[v[i]] += (m / v[i]);
      m = m / v[i];
    }
  }
  long long int ans = 1;
  ;
  for (long int i = 0; i < v.size(); i++) {
    ans = (ans * (power(p[v[i]], v[i]))) % 1000000007;
  }
  cout << ans % 1000000007;
  return 0;
}
