#include<bits/stdc++.h>
#define mod 1999999973
using namespace std;
int n,p;

int ans(int N,int P)
{
    int r = 1;
    while(P)
    {
        if(P % 2 == 1)
            r = (1LL * r * N) % mod;
        N = (1LL * N * N) % mod;
        P = P / 2;
    }
    return r;
}
int main()
{
    FILE *in =fopen("lgput.in","r");
    FILE *out =fopen("lgput.out","w");

    fscanf(in,"%d %d",&n,&p);
    int sol =ans(n,p);

    fprintf(out,"%d",sol);


    fclose(in);
    fclose(out);

}