#include <stdio.h>
#define MOD 9901

long long suma( unsigned n, unsigned q )
{
    unsigned d = 2, p, s = 1;
    while( n > 1 ){
        p = 1;
        while( n % d == 0 ){
            n /= d;
            p *= d;
        }
        if( p > 1 ){
            for( unsigned i = 0; i < q; i++ )
                p *= d;
            s = s * ( ( p - 1 ) / ( d - 1 ) % MOD ) % MOD;
        }
        ++d;
        if( n > 1 && d * d >= n )
            d = n;
    }
    return s;
}

int main()
{
    unsigned n, p;
    FILE *fin = fopen( "sumdiv.in", "r" );
    fscanf( fin, "%u %u", &n, &p );
    fclose( fin );
    FILE *fout = fopen( "sumdiv.out", "w" );
    fprintf( fout, "%lld", suma( n, p ) );
    fclose( fout );
    return 0;
}