/*
    Keep It Simple!
*/

#include <vector>
#include <fstream>
#include <queue>

using namespace std;

const int kMaxN = 1025;
const long long kMod = 1999999973;

long long N,P;

void Solve() {
    ifstream fin("lgput.in");
        fin >> N >> P;
    fin.close();

    long long sol = 1;
    while (P) {
        if(P&1)
            sol = (sol*N)%kMod;
        N = (N*N)%kMod;
        P >>= 1;
    }

    ofstream fout("lgput.out");
    fout << sol << '\n';
    fout.close();
}

int main() {
    Solve();
    return 0;
}