#include <fstream>
#include <iostream>
using namespace std;
ifstream f1("lgput.in");
ofstream f2("lgput.out");

const int prime = 1999999973;
long long n1,p1;

long long pow(long long n, long long p)
{
    if (p==1) return n;

    if (p % 2 == 1)
        return pow(n,p-1)*n % prime;
    else
    {
        long long t= pow(n,p/2) % prime;
        t=(t*t) % prime;
        return t;
    }

}


int main()
{
    f1>>n1>>p1;
    f2<<pow(n1,p1);
    f2.close();
    return 0;
}