#include <cstdio>
#define mod 1999999973
using namespace std;
long long n,p;
long long pow(long long n, long long p)
{
    long long i,a,sol=1;
    a=n;
    for(i=0;(1<<i)<=p;i++)
    {
        if((1<<i)&p)
            sol=(sol*a)%mod;
        a=(a*a)%mod;
    }
    return sol;
}
int main()
{
    freopen("lgput.in","r",stdin);
    freopen("lgput.out","w",stdout);
    scanf("%d%d",&n,&p);
    printf("%lld",pow(n,p));
    return 0;
}