#include <fstream>
#define M 1999999973
using namespace std;
long long n,p;
ifstream f("lgput.in");
ofstream g("lgput.out");

long long putere (long long n,long long p)
{
   long long k=1;
   if (p==0)
    return 1;
   else
    while (p!=1)

       if (p%2==0)
       {
           n=(n*n)%M;
           p=p/2;
       }
       else
       {
           k=(k*n)%M;
           p--;
       }
   return (k*n)%M;
}
int main ()
{
    f>>n>>p;
    g<<putere(n,p);
    f.close();
    g.close();
    return 0;
}