#include <fstream>
#define mod 9901
using namespace std;

int putere(int bz, int xp)
{
	if(xp==0)
		return 1;
	else if(xp%2) return ((bz%mod*(putere(bz, xp/2)%mod)%mod)*putere(bz, xp/2)%mod)%mod;
	return (((putere(bz, xp/2))%mod)*putere(bz, xp/2)%mod)%mod;
}
int a, b, aux, phi, i, pr[100001], ex[100001];
int rez, k;
int main()
{
	ifstream f("sumdiv.in");
	ofstream g("sumdiv.out");
	f>>a>>b;
	aux=mod;
	phi=mod;
	for(i=2; i*i<=aux; i++)
	{
		if(aux%i==0)
		{
			phi=(phi/i)*(i-1);
			aux/=i;
		}
		while(aux%i==0)
			aux/=i;
	}
	if(aux!=1)
		phi=(phi/aux)*(aux-1);
	for(i=2; i*i<=a; i++)
	{
		if(a%i==0)
		{
			k++;
			pr[k]=i;
			while(a%i==0)
				ex[k]++;
		}
	}
	if(a!=1)
	{
		if(!binary_search(pr+1, pr+k+1, a))
		{
			k++;
			pr[k]=a;
			ex[k]++;
		}
		else ex[lower_bound(pr+1, pr+k+1, a)-pr]++;
	}
	rez=1;
	for(i=1; i<=k; i++)
	{
		ex[i]*=b;
		rez=(rez*(((putere(pr[i], ex[i]+1))-1)%mod*(putere(pr[i]-1, phi-1)%mod)))%mod;
	}
	g<<rez;
}