#include <cstdio>

 #include <iostream>

 #include <cstring>

 #include <cmath>

 #define LL long long

 #define mo 9901

 #define N 50000007

 using namespace std;

 LL a, b, ans, Have[N / ];

 int Pri[N / ], S[N / ];

 bool v[N];

 void Pre_work()

 {

     Pri[] = , Pri[] = ;

     for (int i = ; i <= N - ; i += )

     {

         if (!v[i])    Pri[++Pri[]] = i;

         for (int j = ; j <= Pri[] && i * Pri[j] < N - ; v[i * Pri[j]] = , j++);

     }

 }

 LL Fastpow(LL x, LL y)

 {

     LL ret = ;

     x %= mo;

     while (y)

     {

         if (y & ) ret = (ret * x) % mo;

         y >>= ;

         x = (x * x) % mo;

     }

     return ret;

 }

 int main()

 {

 //    freopen("sheep.in", "r", stdin);

 //    freopen("sheep.out", "w", stdout);

     Pre_work();

     scanf("%lld%lld", &a, &b);

     LL p = a;

     for (int i = ; p > ; )

     {

         while (p % Pri[i] != )    i++;

         LL sum = ;

         while (p % Pri[i] == ) Have[i]++, p /= Pri[i];

         Have[i] *= b;

         S[++S[]] = i;

     }

     ans = ;

     for (int i = ; i <= S[]; i++)

     {

         LL v = Fastpow( - Pri[S[i]], mo - );

         LL u = Fastpow(Pri[S[i]], Have[S[i]]);

         u = ( - u * Pri[S[i]]) % mo;

         ans = (ans * u * v) % mo;

     }

     printf("%lld", ans);

 }