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

using namespace std;

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

long long n, p;

long long pow (long long n, long long p) {
    if (p == 0)
        return 1;
    if (p == 1)
        return n % mod;
    if (1 & p)
        return (n*pow((n*n)%mod, p/2))%mod;
    else
        return pow((n*n)%mod, p/2)%mod;
}

int main () {
    fin >> n >> p;
    fout << pow(n, p);
}