#include <cstdio>
#define MOD 9901
using namespace std;
FILE *fin=freopen("sumdiv.in","r",stdin);
FILE *fout=freopen("sumdiv.out","w",stdout);

inline long long int POW(long long int x,long long int y)
{
    long long int i, aux = x, ret = 1;
    for(i = 1; i <= y; i <<= 1)
    {
        if( i & y )
            ret = (1LL * ret * aux) % MOD;
        aux = (1LL * aux * aux) % MOD;
    }
    return ret;
}

inline long long int verif(long long int x)
{
    while( x < 0 )
        x += MOD;
    return x;
}

int main()
{
    long long int a, b, sol = 1, cnt;
    scanf("%lld%lld", &a, &b);
    for(long long int i = 2; i * i <= a; i++)
        if( a % i == 0 )
        {
            cnt = 0;
            while( a % i == 0 )
            {
                ++cnt, a /= i;
            }
            cnt *= b;
            sol = (1LL * sol *  verif((POW(i % MOD, cnt + 1) - 1)) * POW((i - 1), MOD - 2)) % MOD;
        }
    if( a > 1 )
    {
        cnt = b;
        if( a % MOD == 1 )
            sol = (sol * ((b + 1) % MOD)) % MOD;
        else
            sol = (1LL * sol * (verif((POW(a % MOD, cnt + 1) - 1)) * POW((a - 1), MOD - 2))) % MOD;
    }
    printf("%lld", sol);
    return 0;
}