#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;

const int mod = 1999999973;

long long ridicareLaPutere(int n, int p){
    long long r = 1;
    while(p) {
        if(p % 2 == 1)
            r = (r * n) % mod;
        p /= 2;
        n = (n * n) % mod;
    }
    return r;
}

int main(){
    //ifstream fin("date.in.txt");
    ifstream fin("lgput.in");
    ofstream fout("lgput.out");
    int n, p;
    fin >> n >> p;
    fout << ridicareLaPutere(n, p);
    return 0;
}