#include <bits/stdc++.h>

using namespace std;

const long long MOD = 1999999973;

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

long long pow(long long x, long long n) {
    int y = 1;
    while (n > 1) {
        if (n % 2 == 0) {
            x *= x; x %= MOD; n /= 2;
        } else {
            y *= x; x *= x; x %= MOD; n = (n - 1) / 2;
        }
    }
    return (x * y) % MOD;
}

int main() {
    int N, P; fin >> N >> P;
    fout << pow(N, P) << endl;
}