#define REP(a,b) for(int a=0; a<(b); ++a)
#define FWD(a,b,c) for(int a=(b); a<(c); ++a)
#define FWDS(a,b,c,d) for(int a=(b); a<(c); a+=d)
#define BCK(a,b,c) for(int a=(b); a>(c); --a)
#define ALL(a) (a).begin(), (a).end()
#define SIZE(a) ((int)(a).size())
#define VAR(x) #x ": " << x << " "
#define FILL(x,y) memset(x,y,sizeof(x))
#define MIN(a,b) (((a)<(b))?(a):(b))
#define MAX(a,b) (((a)>(b))?(a):(b))
#define x first
#define y second
#define st first
#define nd second
#define pb push_back
#define l(n) (n<<1)
#define r(n) ((n<<1)+1)
#define f(n) (n>>1)
#define lsb(a) (a&-a)

#include<vector>

using namespace std;
#include<fstream>
ifstream cin("sumdiv.in");
ofstream cout("sumdiv.out");

const int CIUR = 100000;
const int MOD = 9901;
const int INF = 0x3f3f3f3f;
const int dx[] = {0,0,-1,1}; //1,1,-1,1};
const int dy[] = {-1,1,0,0}; //1,-1,1,-1};

typedef long long LL;
typedef pair<int, int> PII;
typedef long double K;
typedef pair<K, K> PKK;
typedef vector<int> VI;

int n,m,i,j;
bool viz[CIUR];
int p[CIUR];

void ciur()
{
	int k=0;
	for(int i=2; i<=CIUR; ++i)
		if(!viz[i])
		{
			p[++k]=i;
			for(int j=2*i; j<=CIUR; j+=i)
				viz[j]=true;
		}
}

int binexp(int n, int p)
{
	int x=1;
	while(p)
	{
		if(p&1)
		{
			x*=n; x%=MOD; p--;
		}
		n*=n; n%=MOD;
		p/=2;
	}
	return x;
}

long long a,b,s;

int main()
{
	cin>>a>>b;
	ciur();
	s=1;
	for(int i=1; p[i]*p[i]<=a; ++i)
	{
		if(a%p[i]==0)
		{
			int k=0;
			
			while(a%p[i]==0)
			{
				a/=p[i];
				k++;
			}
			s*=(binexp(p[i], b*k+1)-1)*binexp(p[i]-1, MOD-2); s%=MOD;
			
		}
	}
	if(a>1)
		s*=(binexp(a, b+1)-1)*binexp(a-1, MOD-2); s%=MOD;
	cout<<s;
	
	return 0;
}