#include <iostream>
#include <fstream>
#define mod 9901
#include <cmath>

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

int sum(long long n)
{
    int i,nr=1,sum=1,rez=1;
    for(i=2;i*i<=n;i++)
    {
        sum=1;
        nr=1;
        while(n%i==0)
        {
            nr=(1LL*nr*i)%mod;
            sum=(1LL*sum+nr)%mod;
            n=n/i;
        }
        rez=(1LL*rez*sum)%mod;
    }
    if(n>=2)
        rez=(1LL*rez*(n+1))%mod;
    return rez;
}
long long n,a,b;
int main()
{
    f>>a>>b;
  n=pow(a,b);
  g<<sum(n);

    return 0;
}