#include <fstream>

using namespace std;
ifstream cin("lgput.in");
ofstream cout("lgput.out");
int mod=1999999973;
/*
int putere(int n, int p)
{
    if(p==0)
        return 1;
    int x=(1LL*putere(n,p/2))%mod;
    if(p%2==0)
        return (1LL*x*x)%mod;
    else
        return (((1LL*n*x)%mod)*x)%mod;
}  recursivitate
*/
int putere(int n, int p)
{
    int sol=1;
    while(p>0)
    {
        if(p%2==1)
            sol=(1LL*n*sol)%mod, p--;
        else
            sol=(1LL*sol*sol)%mod, p/=2;
    }
    return sol;
}
int main()
{
    int n,p;
    cin>>n>>p;
    cout<<putere(n,p);
    return 0;
}