#define MOD 1999999973
#include <iostream>
#include <fstream>
using namespace std;

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

long long fast_pow(long long n, long long p){
    long long result = 1;
    while(p > 0){
        if(p & 1) result = (result * n) % MOD;
        n = (n * n) % MOD;
        p >>= 1;
    }
    return result % MOD;
}

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