#include <bits/stdc++.h>
#define MOD 9901
using namespace std;
ifstream f("sumdiv.in");
ofstream g("sumdiv.out");
long long int n,m;
long long int PutereExp(long long int a,long long int b)
{
    long long int rez=1;
    while(b)
    {
        if(b&1)
            rez=(rez*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return rez;
}
long long int CalculFactorPrim(long long int x,long long int m1)
{
    return (1LL*((PutereExp(x,m1+1)-1+MOD)%MOD)*PutereExp(x-1,MOD-2))%MOD;
}
int main()
{
    f>>n>>m;
    if(n==0)
    {
        g<<0;
        return 0;
    }
    long long int d=2,rez=1;
    while(n>1)
    {
        int p=0;
        while(!(n%d))
            p++,n/=d;
        if(p&&d%MOD==1)
            rez=(rez*(p*m+1))%MOD;
        else if(p)
            rez=(rez*CalculFactorPrim(d,p*m))%MOD;
        d++;
        if(d*d>n&&n>1)
            d=n;

    }
    g<<rez;
    return 0;
}