#include<bits/stdc++.h>
#define fi first
#define se second
#define ull unsigned long long
#define make make_pair
#define N 1000000
#define int long long
#define mod 1000000007
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;
}
int n,m,p[N],num[N],tot;
int ksm(int d,int z)
{
	int ans=1;
	while(z)
	{
		if(z&1)ans=(ans*d)%mod;
		d=(d*d)%mod;z>>=1;
	}
	return ans;
}
signed main()
{
	n=read();m=read();
	for(int i=2;i*i<=n;i++)
	{
		if(n%i==0)p[++tot]=i;
		while(n%i==0)num[tot]++,n/=i;
	}
	if(n>1)p[++tot]=n,num[tot]=1;
	int ans=1;
	for(int i=1,c;i<=tot;i++)
	{
		c=1;
		for(int j=1;j<=num[i];j++)
		{
			c*=p[i];
			ans=(ans*ksm(p[i],m/c))%mod;
		}
	}
	cout<<ans<<"\n";
	return 0;
}