#include <iostream>

using namespace std;
long long binpow(long long a, long long b, long long m) {
    a %= m;
    long long res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a % m;
        a = a * a % m;
        b >>= 1;
    }
    return res;
}
int main()
{
    const int mod=1999999973;
    int n,p;
    cin>>n>>p;
    cout << binpow(n,p,mod);
    return 0;
}