#include<cstdio>
using namespace std;
long long int b,e,p=1,mod=1999999973;
void read(),solve();
int main()
{
	read();
	solve();
	
	return 0;
}

void read()
{
	freopen("lgput.in","r",stdin);
	freopen("lgput.out","w",stdout);
	scanf("%lld%lld",&b,&e);
}

void solve()
{
	while(e){if(e&1)p=(p*b)%mod ;b=(b*b)%mod;e>>=1;}
	printf("%lld",p);
}