#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll mod=1e9+;

const int N=1e5+;

int arr[N];

ll ksm(ll x,ll y){

    ll res=;

    while(y){

        if(y&) res=(res%mod*x%mod)%mod;

        y>>=;

        x=(x%mod*x%mod)%mod;

    }

    return res%mod;

}

int main(){

    ll n,m;

    cin>>n>>m;

    ll pos=;

    for(ll i=;i*i<=n;i++){

        if(n%i==){

            arr[pos++]=i;

            while(n%i==)    n/=i;

        }

    }

    if(n!=) arr[pos++]=n;

    ll ans=;

    for(ll i=;i<pos;i++){

        ll z=m;

        ll t2=;

        while(z){

            ll t1=z/arr[i];

            z/=arr[i];

            t2+=t1;

        }

        ans=(ans%mod*ksm(arr[i],t2)%mod)%mod;

    }

    cout<<ans<<endl;

    return ;

}