#include <iostream>
#include <fstream>
const int mod = 1999999973;
using namespace std;
ifstream f("lgput.in");
ofstream g("lgput.out");
int main()
{
   unsigned long long i = 1,p,n,sol;
   f>>n>>p;
   sol = n;
   while(i < p)
   {
       if(i*2 <= p)
           sol = sol*sol%mod,i*=2;
       else
           while(i < p)
            sol = sol*n%mod,i++;


   }

    g<<sol;
    return 0;
}