#include <set>
#include <bitset>
#include <list>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <string>
#include <vector>
#include <ios>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <utility>
#include <complex>
#include <numeric>
#include <functional>
#include <cmath>
#include <ctime>
#include <climits>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cassert>
#define lson rt << 1, l, m
#define rson rt << 1 | 1, m + 1, r
using namespace std;
const int INF = 0x7FFFFFFF;
const double EPS = 1e-10;
const double PI = 2 * acos (0.0);
const int MOD = 1000000000 + 7;
const int maxn = 10000 + 666;
bool prime[maxn];
int primelist[maxn], prime_len;
void GetPrime ()
{
memset (prime, true, sizeof (prime));
prime_len = 0;
int i;
for (i = 2; i <= maxn; i++)
{
if (prime[i])
primelist[prime_len++] = i;
int j;
for (j = 0; j < prime_len; j++)
{
if (i * primelist[j] > maxn)
break;
prime[i*primelist[j]] = false;
if (i % primelist[j] == 0)
break;
}
}
}
long long mult_mod (long long a,long long b,long long mod)
{
a %= mod;
b %= mod;
long long ans = 0;
long long temp = a;
while (b)
{
if (b & 1)
{
ans += temp;
if (ans > mod)
ans -= mod;//直接取模慢很多
}
temp <<= 1;
if (temp > mod)
temp -= mod;
b >>= 1;
}
return ans;
}
long long pow_mod (long long a,long long n,long long mod)
{
long long ans = 1;
long long temp = a % mod;
while (n)
{
if (n & 1)
ans = mult_mod (ans, temp, mod);
temp = mult_mod (temp, temp, mod);
n >>= 1;
}
return ans;
}
long long GetFactorSum (long long a, long long b, long long mod)
{
long long ans = 1;
for (long long i = 0; primelist[i] * primelist[i] <= a; i++)
{
if (a % primelist[i] == 0)
{
long long tempsum = 0;
while (a % primelist[i] == 0)
{
tempsum++;
a /= primelist[i];
}
long long m = (primelist[i] - 1) * mod;
ans *= (pow_mod (primelist[i], tempsum * b + 1, m) + m - 1) / (primelist[i] - 1);
ans %= mod;
}
}
if (a > 1)
{
long long m = (a - 1) * mod;
ans *= (pow_mod (a, b + 1, m) + m - 1) / (a - 1);
ans %= mod;
}
return ans;
}
int main()
{
// ifstream cin ("aaa.txt");
GetPrime ();
long long a, b;
while (cin >> a >> b)
{
cout << GetFactorSum (a, b, 9901) << endl;
}
return 0;
}