#include <cstdio>
#define mod 1999999973

using namespace std;

FILE *fin=freopen("lgput.in","r",stdin);
FILE *fout=freopen("lgput.out","w",stdout);

int n,p;

int ceva(int n,int p){
	--p;
	rez=1;
	while(p){
		if(p%2){
			b=(b*n)%mod;
			--p;
		}
		n=(n*n)%mod;
		p/=2;
	}
	return rez;
}


int main()
{
    scanf( "%d %d",&n,&p);
    printf("%d\n",ceva(n,p));
    return 0;
}