#include <iostream>
#include <fstream>
using namespace std;
ifstream f("lgput.in");
ofstream g("lgput.out");
const int mod=1999999973;
long long int n,p;
int pow(long long int n,long long int p)
{long long int a,sol=1,i;
   a=n;
   for( i=0;(1<<i)<=p;i++)
      {if(p&(1<<i))sol=(sol*a)%mod;
       a=(a*a)%mod;
       }
       return sol;

}
int main()
{  f>>n>>p;
     g<<pow(n,p);


}