#include <cstdio>

const int r = 9901;
const int N = 1<<13;

int p[N],invers[r],np;
bool c[N];

void ciur()
{
	int i,j;
	for(i=2 ; i*i < N ; ++i)
		if(!c[i])
			for(j=i*i ; j < N ; j+=i)
				c[j] = true;
	for(i=2 ; i < N ; ++i)
		if(!c[i])
			p[++np] = i;
}

void calcul_invers()
{
	int i,j;
	for(i=1 ; i<r ; ++i)
	{
		if(invers[i]!=0)
			continue;
		for(j=i ; j<r ; ++j)
			if(i*j%r == 1)
			{
				invers[i] = j;
				invers[j] = i;
			}
	}
}

int putere(int a,int n)
{
	int pr = 1;
	while(n != 0)
	{
		if(n&1)
			pr = pr*a%r;
		a = a*a%r;
		n >>= 1;
	}
	return pr;
}

int suma(int a,int b)
{
	int i,exp,s = 1,pow;
	for(i=1 ; p[i]*p[i] <= a ; ++i)
	{
		if(a%p[i] != 0)
			continue;
		for(exp=0 ; a%p[i] == 0 ; a/=p[i])
			++exp;
		pow = putere(p[i],exp*b+1);
		s = s*(pow-1)*invers[p[i]-1];
		s %= r;
	}
	if(a != 1)
	{
		pow = putere(a,b+1);
		s *= (pow-1)*invers[a-1];
		s %= r;
	}
	return s;
}

int main()
{
	freopen("sumdiv.in","r",stdin);
	freopen("sumdiv.out","w",stdout);
	int a,b;
	scanf("%d%d",&a,&b);
	ciur();
	calcul_invers();
	printf("%d\n",suma(a,b));
	return 0;
}