#include <iostream>
#include <fstream>
#include <vector>
#include <list>
#include <queue>
using namespace std;
#define N 1999999973
long long power(long long n,long long p)
{
	if (p==0)
		return 1;
	if (p==1)
		return n;
	long long r1 = power(n,p/2);
	if (p%2== 0)
		return (r1*r1)%N;
	else
		return (((r1*r1)%N)*n)%N;
	
}
int main()
{
	FILE *f = fopen("lgput.in","r");
	FILE *g = fopen("lgput.out","w+");

	long long n,p;
	fscanf(f,"%lld %lld",&n,&p);
	long long res = power(n,p);
	fprintf(g,"%lld\n",res);
	fclose(f);
	fclose(g);
}