#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <stdint.h>
#include <math.h>
 
typedef unsigned int uint;
 
#define M 9901
 
void fact(long long int a, long long int b, FILE *out);
long long int binexp(long long int x, long long int n);
long long int egcd(long long int a, long long int b, long long int *x, long long int *y);
long long int inv(long long int a, long long int m);
 
int main(void)
{
    FILE *in =  fopen("C:/Users/arco/Desktop/code/ads.txt", "r");
	FILE *out = fopen("C:/Users/arco/Desktop/code/out.txt", "w");
 
    if(in != NULL && out != NULL)
    {
        long long int a, b;
        fscanf(in, "%lld%*c%lld", &a, &b);
        fact(a, b, out);
 
        fclose(in);
        fclose(out);
    }
    else
    {
        printf("file error\n");
    }
 
    return 0;
}
 
long long int inv(long long int a, long long int m)
{
    long long int x, y;
    long long int d = egcd(a, m, &x, &y);
    if(d == 1)
    {
        return ((x % m) + m) % m;
    }
    else
    {
        printf("No invers moduloar\n");
    }
}
 
long long int egcd(long long int a, long long int b, long long int *x, long long int *y)
{
    if(a == 0)
    {
        *x = 0;
        *y = 1;
        return b;
    }
    else
    {
        long long int x1, y1;
        long long int d = egcd(b % a, a, &x1, &y1);
        *x = y1 - (b / a) * x1;
        *y = x1;
        return d;
    }
}
 
long long int binexp(long long int x, long long int n)
{
    long long int res = 1;
    while(n)
    {
        if(n % 2 != 0)
        {
            res = ((res % M) * (x % M)) % M; 
        }
        x = ((x % M) * (x % M)) % M;
        n /= 2;
    }
    return res;
}
 
void fact(long long int a, long long int b, FILE *out)
{
    long long int s = 1;
    long long int d = 2;
    while(a > 1)
    {
        long long int p = 0;
        while(a % d == 0)
        {
            p++;
            a /= d;
        }
        if(p)
        {
            p *= b;
            long long int calc = (((binexp(d, p + 1) - 1) % M) * (inv(d - 1, M))) % M;
            s = ((s % M) * (calc % M)) % M;
        }
        d++;
        if(a > 1 && d * d > a)
        {
            d = a;
        }
    }
    fprintf(out, "%lld\n", s);
}