#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("lgput.in");
ofstream fout("lgput.out");

long long int mod = 1999999973;
long long int n, p, a = 1;


void putere()
{
    while(p != 1)
    {
        if(p % 2 == 1)
        {
            a = (a % mod * n % mod)%mod;
            p--;
        }
        else
        {
            n = ((n% mod) *(n%mod)) % mod;
            p/=2;
        }
    }
    fout << (a * n) % mod;
}

int main()
{
    fin >> n >> p;
    putere();
    return 0;
}