#include <iostream>
#include <fstream>

using namespace std;

#define modulo 9901

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

long long A, B;

long long putere( long long a, long long p ){

    long long res = 1;

    for ( long long i = 0; ( 1 << i ) <= p; ++i ){

        if ( ( 1 << i ) & p )
            res = ( res * a ) % modulo;

        a = ( a * a ) % modulo;
    }

    return res;
}

void rezolva(){

    long long S = 1, e = 0;

    for ( long long d = 2; d * d <= A && A > 1; ++d ){

        if ( A % d )
            continue;

        e = 0;

        while ( A % d == 0 )
            A /= d,
            e++;

        if ( d % modulo == 1 )
            S *= 1LL * ( e + 1 ) % modulo;
        else{
                long long p1 = ( putere ( d, e * B + 1 ) + modulo - 1 ) % modulo;
                long long p2 = putere( d - 1, modulo - 2 ) % modulo;

                S *= 1LL * p1 * p2;
                S %= modulo;
        }
    }

    if ( A > 1 ){

        if ( A % modulo == 1 )
            S = ( S * 1LL * ( B % modulo + 1 ) ) % modulo;
        else{
                long long p1 = ( putere ( A, B + 1) + modulo - 1 ) % modulo;
                long long p2 = putere ( A - 1, modulo - 2 ) % modulo;

                S *= 1LL * p1 * p2;
                S %= modulo;
        }
    }

     if ( A == 0 )
        g << 0 << "\n";
     else
        g << S << "\n";

    g.close();
}

void citire(){

   f >> A >> B;

   f.close();
}


int main(){

    citire();
    rezolva();

    return 0;
}