#include <iostream>
#include <fstream>
#include <cmath>
#include <vector>
#include <queue>
#include <deque>
#include <list>
#include <string>
#include <algorithm>
using namespace std;
ifstream ff("lgput.in");
ofstream gg("lgput.out");
#define md 1999999973
long long n, p;

void exp(){
	long long r=1;
	while(p){
		if(p&1){ r=(r*n)%md; p--; } else {
			n=(n*n)%md; p>>=1; }
	}
	gg << r;
}

int main(){
	ff >> n >> p;
	exp();
	return 0;
}