#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <queue>
#define int long long
using namespace std;
int read(){
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
const int Mod = 1e9+7;
int n,m,ans = 1;
int ksm(int x,int y){
	int res = 1;
	while(y){
		if(y&1){
			res = res*x%Mod;
		}
		y>>=1;
		x = x*x%Mod;
	}
	return res;
} 
signed main(){
	n = read();m = read();
	for(int i=2;i*i<=n;i++){
		int cnt = 0;
		while(n%i==0){
			cnt++;
			n/=i;
		}
		if(cnt){
			int res = 0;int x = m;
			for(int j=1;j<=cnt;j++){
				x/=i;
				res+=x;
			}
			ans = ans*ksm(i,res)%Mod;
		}
	}
	if(n!=1){
		ans = ans*ksm(n,m/n)%Mod;
	}
	cout<<ans<<"\n";
	return 0;
}