#include <fstream>
#include <bitset>

using namespace std;

const int MAX_N = 7200;
const int MOD = 9901;

ifstream fin ("sumdiv.in");
ofstream fout ("sumdiv.out");

long long N,B;
int T, K, P[7200];
char viz[MAX_N];

void ciur() {
	for(int i = 2; i < MAX_N; ++i) {
		if(viz[i] == 0) {
			P[++K] = i;

			for(int j = i+i; j < MAX_N; j += i) {
				viz[j] = 1;
			}
		}
	}
}

inline int pow(int x, long long p) {
	int rez = 1;
	x %= MOD;

	for(; p; p >>= 1) {
		if(p & 1) {
			rez *= x;
			rez %= MOD;
		}

		x *= x;
		x %= MOD;
	}

	return rez;
}

void solve() {
fin >> N>>B;

	int	nd = 1, sd = 1;

	for(int i = 1; i <= K; ++i) {
		if(N % P[i]) continue;
		long long p = 0;
		
		while(N % P[i] == 0) {
			N /= P[i];
			++p;
		}
		
		int p1 = (pow(P[i], p*B+1) - 1) % MOD;
		int p2 = pow(P[i]-1, 1LL*MOD-2) % MOD;
		
		sd = (((sd * p1) % MOD) * p2) % MOD;
	}

	if(N > 1) {
		nd *= 2;
		sd = (1LL*sd*(N+1) % MOD);
	}

	fout <<sd<<"\n";
}

int main() {
	ciur();
	solve();
}