#include <iostream>
#include <fstream>

int mod = 1999999973;
using namespace std;
int solve(long long n,int p){
	if(p == 0)
		return 1;
	if(p%2 == 0){
		return solve((long long)(n*n)%mod,p/2);
	}else{
		return (n * solve(n%mod,p-1))%mod;
	}
}

int main(){
	ofstream out("lgput.out");
	ifstream in("lgput.in");
	int n,p;
	in >> n >> p;
	out << solve(n,p) << endl;
	return 0;
}