#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)
{
	int p = 0;
	sd = 1;
	for(int d=2;d*d<=nr;d++)
		if(nr%d==0)
		{	
			while(nr%d==0) nr/=d , p++;
			p*=B;
			if(nr%MOD==1)
				sd = sd*((d+1)%MOD)%MOD;
			else
			sd= (sd*(lgpow(d,p+1)-1+MOD)%MOD*lgpow(d-1,MOD-2))%MOD;
			p = 0;
		}
	if(nr>1)
	{
		p = B;
		if(nr%MOD==1)
			sd = (sd*(nr+1)%MOD)%MOD;
		else
		sd= (sd*(lgpow(nr,p+1)-1+MOD)%MOD*lgpow(nr-1,MOD-2))%MOD;
	}

}

int main()
{
	fin>>A>>B;
	if(!B) fout<<0<<'\n';
	else
	{
	solve(A);
	fout<<sd<<"\n";
	}
	return 0;
}