#include <bits/stdc++.h>
#define MOD 1999999973

using namespace std;

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

int lgpow(int n, int k) {
    int p = 1;
    while (k) {
        if (k % 2)
            p = (int)(((long long) p * n) % MOD);
        n = ((long long) n * n) % MOD;
        k /= 2;
    }

    return p;
}

int main() {
    int n, p;
    fin >> n >> p;
    fout << lgpow(n, p);
    return 0;
}