#include <fstream>
#include <algorithm>
using namespace std;
#define mod 1999999973
ifstream f("lgput.in");
ofstream g("lgput.out");

long long n;

long long pow(long long k){
    if(k == 1)return n; else
    {
        long long r = pow(k/2);
        if(k%2) return r*r%mod*n%mod; else
                return r*r%mod;
    }
}

int main(){
    long long k;
    f >> n >> k;

    g << pow(k) << '\n';

    return 0;
}