#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/=2;
    }
    return r;
}
int main()
{
    FILE *in =fopen("date.in","r");
    FILE *out =fopen("date.out","w");

    fscanf(in,"%d,%d",&n,&p);

    fprintf(out,"%d",ans(n,p));

}