#include <iostream>
#include <fstream>
#define MOD 1999999973
using namespace std;

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

long long n, p;

long long pow(long long n, long long p)
{
    long long r=1;
    while(p!=1)
    {
        if(p%2==1)
        {
            r=(r%MOD*n%MOD)%MOD;
            p--;
        }
        n=(n%MOD*n%MOD)%MOD;
        p/=2;
    }
    return (r%MOD*n%MOD)%MOD;
}

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