#include <iostream>
#include <fstream>

using namespace std;

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

const int mod = 1999999973;

long long putere(long long n, long long p)
{
	long long sol = 1;
	long long baza = n;
	long long exponent = 1;

	while (exponent <= p)
	{
		// apare exponent in descompunerea binara a puterii
		if (p & exponent)
		{
			sol *= baza;
			sol %= mod;
		}

		baza = (baza * baza) % mod;
		exponent *= 2;

	}

	return sol;
}

int main()
{
	long long n, p;
	fin >> n >> p;

	fout << putere(n, p);
}