#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1000000007;
int qp(int p,int q){
	int ans = 1,pro = p;
	while(q){
		if(q&1)ans = ans*pro%mod;
		pro = pro*pro%mod;q>>=1;
	}return ans;
}
int n,m;
vector<pair<int,int> >f;
signed main(){
	cin >> n >> m;
	for(int i = 1;i*i<=n;i++){
		if(n%i == 0){
			f.push_back({i,(m/i)});
			if(i*i == n)continue;
			f.push_back({n/i,(m/(n/i))});
		}
	}sort(f.begin(),f.end());
//	cout << 111 << endl;
	for(int i = (int)f.size()-1;i>=0;i--){
		for(int j = i+1;j<f.size();j++){
			if(f[j].first%f[i].first == 0){
				f[i].second-=f[j].second;
			}
		}
	}int ans = 1;
	for(auto x:f)ans = ans*qp(x.first,x.second)%mod;
	cout << ans << endl;
}