#include <bits/stdc++.h>
#define mod 9901
using namespace std;

ifstream f("sumdiv.in");
ofstream g("sumdiv.out");

const int N = 50000001;
vector <int> v;
bool w[N];
int n, m;
void gen()
{
    for(int i = 2; i <= N; ++ i)
    {
        if(w[i] == 0)
        {
            v.push_back(i);
            for(int j = i + i; j <= N; j += i)
                w[j] = 1;
        }
    }
}
long long lgput(long long a, long long b)
{
    long long r = 1;
    while(b)
    {
        if(b % 2 == 1)
            r = ( r % mod * a % mod ) % mod;
        a = ( a % mod * a % mod ) % mod;
        b /= 2;
    }
    return r;
}
long long sum_div(long long n)
{
    long long fm, q = 0, s = 1;
    do
    {
        fm = 0;
        while(n % v[q] == 0)
        {
            n /= v[q];
            fm ++;
        }
        if(fm > 0)
        {
            s = s * (lgput(v[q], fm + 1) - 1) / (v[q] - 1);
        }
        q ++;
        if(v[q] * v[q] > n && n > 1)
        {
            s = s * (v[q] * v[q] - 1) / (v[q] - 1);
            n = 1;
        }
    }while(n > 1);
    return s;
}
int main()
{
    gen();
    f >> n >> m;
    g << sum_div(lgput(n, m));
    return 0;
}