#include<fstream>
#define mod 1999999973
using namespace std;
unsigned long long n,p,k,rez,rez1;
int main()
{
	ifstream f("lgput.in");
	ofstream g("lgput.out");
	f>>n>>p;
	n=n%mod;
	k=rez=1;
	rez1=n;
	while(p>1)
	{
		while(k<p/2)
		{
			rez1=((rez1%mod)*(rez1%mod))%mod;
			k=k*2;
		}
		p=p-k;
		rez=(rez*rez1)%mod;
		k=1;
		rez1=n;
	}
	if(p==1)
		rez=(rez*n)%mod;
	g<<rez;
	return 0;
}