#include <fstream>
#include <iostream>
#define mod 1999999973

using namespace std;


ifstream f("lgput.in");
ofstream g("lgput.out");

long long n,p;

long long pow(long long a, long long b)
{
    long long i, r = 1;
    for(i=0 ; (1<<i) <= b ; i++)
    {
        if( b & (1<<i))
         r = (r*a)%mod;

         a = (a*a)%mod;
    }
    return r;

}



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