#include <bits/stdc++.h>
using namespace std;

ifstream fin("lgput.in");
ofstream fout("lgput.out");

const int m = 1999999973;
long long n,p;

long long Putere(int a , int n)
{
    long long  sol = 1;
    for (int i = 0; (1<<i) <= p; ++ i) 
	{
		if ( ((1<<i) & p) > 0)
			sol= (sol * a) % m;
	
			a=(a * a) % m;
	}
    return sol;
}

int main(){
    fin >> n >> p;
    fout << Putere(n, p);
    return 0;
}