#include <iostream>
#include <fstream>

using namespace std;

const long long M = 1999999973;

long long int power(long long int n, long long int p) //computes n ^ p modulo M
{
    if(p == 0)
        return 1;

    long long int x = 1;
    while(p > 1)
    {
        if(p % 2)
        {
            x = ((x % M) * (n % M)) % M;
            p--;
        }
        n = ((n % M) * (n % M)) % M;
        p = p / 2;
    }
    
    return ((n % M) * (x % M)) % M;
}

int main(void)
{
    ifstream fin("lgput.in");
    ofstream fout("lgput.out");
    
    long long int n, p;
    fin >> n >> p;

    fout << power(n, p) << "\n";

    fin.close();
    fout.close();
    return 0;
}