#include <bits/stdc++.h>
using namespace std;
ifstream fin ("sumdiv.in");
ofstream fout ("sumdiv.out");
const short Mod = 9901;
int a, b;
inline int Lgput(int x, int a)
{
    int s = 1;
    while(a > 0)
    {
        if(a % 2 == 1)
            s = 1LL * s * x % Mod;
        a /= 2;
        x = 1LL * x * x % Mod;
    }
    return s;
}
inline void Solve()
{
    int d = 2, s = 0, p, sol = 1;
    while(a % d == 0)
    {
        s++;
        a /= d;
    }
    p = (Lgput(d, s * b + 1) - 1 + Mod) % Mod;
    sol = (1LL * ( 1LL * sol * p ) % Mod * Lgput(d - 1, Mod - 2)) % Mod;
    d++;
    while(a > 1 && 1LL * d * d <= a)
    {
        s = 0;
        while(a % d == 0)
        {
            s++;
            a /= d;
        }

        p = (Lgput(d, s * b + 1) - 1 + Mod) % Mod;
        sol = (1LL * ( 1LL * sol * p ) % Mod * Lgput(d - 1, Mod - 2)) % Mod;
        d += 2;
    }
    if(a > 1)
    {
        if(a % Mod == 1)
            sol = 1LL * sol * (b + 1) % Mod;
        else
            {
                p = (Lgput(a, b + 1) - 1 + Mod) % Mod;
                sol = (1LL * ( 1LL * sol * p ) % Mod * Lgput(a - 1, Mod - 2)) % Mod;
            }
    }
    fout << sol << "\n";
}
int main()
{
    fin >> a >> b;
    Solve();
    fin.close();
    fout.close();
    return 0;
}