#include <cstdio>
using namespace std;

const int N=1000005;
bool c[N];
int v[N];


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

long long Fast_pow(long long a, long long b,long long m)
{
	long long p;
	if(b==0)
		return 1;
	if(b==1)
		return a%m;
	p=Fast_pow(a%m,b/2,m);
	if(b%2==0)
		return (p%m * p%m) %m;
	if(b%2==1)
		return ((p%m * p%m)%m*a%m)%m;

}



int main()
{
	freopen("sumdiv.in","r",stdin);
	freopen("sumdiv.out","w",stdout);
	long long i,p;
	long long suma,a,b,x;
	ciur();
	scanf("%lld%lld",&a,&b);
	suma=1;
	long long m=9901;
		
	for(i=1;v[i]*v[i]<=a;++i)
		if(a%v[i]==0)
		{
				p=0;
				while(a%v[i]==0)
				{
					++p;
					a/=v[i];
				}
				x=p*b+1;
				suma=suma*(Fast_pow(v[i],x,m)-1)/(v[i]-1);
				suma=suma%9901;
		}
	
		if(a!=1)
		{
			x=b+1;
			suma=suma*(Fast_pow(a,x,m)-1)/(a-1);
			suma=suma%9901;
		}
		printf("%lld\n",suma);

	return 0;
}