#include <iostream>
#include <cstdio>
#define MOD 9901
using namespace std;
long long a,b,sol=1;
void divizori(int baza, int p)
{
    int s=1,po=1;
    for(long long i=1;i<=p;i++)
    {
         po*=baza;
         po%=MOD;
         s+=po;
         s%=MOD;
    }
    sol*=s;
    sol%=MOD;
}
void putere(int baza)
{
    long long p=0;
    while(a%baza==0)
    {
        p++;
        a/=baza;
    }
    p*=b;
    divizori(baza,p);
}
void prim()
{
    if(a%2==0)
        putere(2);
    else if(a%3==0)
        putere(3);
    for(long long i=5;i*i<=a && a>1;i+=6)
    {
        if(a%i==0)
            putere(i);
        if(a%(i+2)==0)
            putere(i+2);
    }
}
int main()
{
    freopen("sumdiv.in","r",stdin);
    freopen("sumdiv.out","w",stdout);
    scanf("%lld %lld", &a, &b);
    prim();
    if(a==0)
        cout<<"0";
    else
        cout<<sol;
    return 0;
}