#include <cstdio>
#define mod 1999999973

using namespace std;

int N, P;
long long nr;

long long putere(int n, int p)
{
    if(n==1||p==1)
        return n;
    if(n==0)
        return 0;
    if(p==0)
        return 1;

    if(p%2)
        return n*putere(n,(p-1)/2)%mod*putere(n,(p-1)/2)%mod;
    return
        putere(n,p/2)*putere(n,p/2)%mod;
}

int main()
{
    freopen("lgput.in","r",stdin);
    freopen("lgput.out","w",stdout);
    scanf("%d%d",&N,&P);
    nr=putere(N,P);
    printf("%lld\n",nr);
    return 0;
}