#include<cstdio>
const int mod=9901;
int inv[9901],i,x,y,a,b,n;
void invers(int a,int b,int &x,int &y)
{
	if(b==0)
	{
		x=1;
		y=0;
	}
	else
	{
		int x0,y0;
		invers(b,a%b,x0,y0);
		x=y0;
		y=x0-(a/b)*y0;
	}
}
int pow(int a,int b)
{
	if(b==1)
		return a%mod;
	int x=pow(a,b/2);
	x=(x*x)%mod;
	if(b&1) x=(x*a)%mod;
	return x;
}
int main()
{
	freopen("sumdiv.in","r",stdin);
	freopen("sumdiv.out","w",stdout);
	inv[1]=1;
	for(i=2;i<mod;i++)
		if(!inv[i])
		{
			invers(i,mod,x,y);
			if(x<0) x=x+mod;
			x=x%mod;
			inv[i]=x;
			inv[x]=i;
		}
	scanf("%d %d",&a,&b);
	if(a!=1 && b) 
	{
		i=2;
		n=1;
		while(i*i<=a && n)
		{
			x=0;
			while(a%i==0)
				a/=i,x++;
			if(x)
			{
				n=(n*(pow(i,(x+1)*b)-1)*inv[(i-1)%mod])%mod;
				if(n<0) n+=mod;
			}
		}
		if(a!=1 && n)
			n=(n*(pow(a,b+1)-1)*inv[(a-1)%mod])%mod;
		if(n<0) n+=mod;
	}
	else
		n=1;
	printf("%d\n",n);
	fclose(stdout);
	return 0;
}