#include <fstream>

using namespace std;

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

const int MOD = 9901;
int A , B , sd ;

int lgpow(int x,int y)
{
	int ans = 1;
	for(;y;y>>=1)
	{
		if(y & 1) 
			ans = (ans*x)%MOD , y--;

		x = (x*x)%MOD;
	}
	return ans;
}

void solve(int nr)
{
	sd = 1;
	for(int d=2;d*d<=nr;d++)
		if(nr%d==0)
		{
			int p = 0 , nr1 , nr2;
			while(nr%d==0) nr/=d , p++;

			nr1 = (lgpow(d,p+1)-1)%MOD;
			nr2 = lgpow(d-1,MOD-2)%MOD;
			sd = (((sd * nr1)%MOD) *nr2)%MOD;
		}

	if(nr>1)
		sd = (sd*(nr+1))%MOD;
}

int main()
{
	fin>>A>>B;
	solve(lgpow(A,B));
	fout<<sd<<"\n";
	return 0;
}