#include <bits/stdc++.h>

using namespace std;

const int MOD = 9901;

int invMod( int b ) {
  int inv = 1;
  while ( (b * inv) % MOD != 1 )
    inv++;
  return inv;
}

int pow_mod( int p, int e ) {
  int rez = 1;
  while ( e > 0 ) {
    if ( e % 2 == 1 )
      rez = ((long long)rez * p) % MOD;
    p = ((long long)p * p) % MOD;
    e /= 2;
  }
  return rez;
}

int main() {
  FILE *fin, *fout;
  long long a, b, numarator, numitor, i, e;

  fin = fopen( "sumdiv.in", "r" );
  fscanf( fin, "%d%d", &a, &b );
  fclose( fin );

  numarator = numitor = 1;
  for ( i = 2; i * i <= a; i++ ) {
    if ( a % i == 0 ) {
      e = 0;
      while ( a % i == 0 ) {
        e++;
        a /= i;
      }
      numarator = (numarator * (pow_mod( i, e * b + 1 ) - 1)) % MOD;
      numitor = (numitor * (i - 1)) % MOD;
    }
  }
  if ( a > 1 ) {
    numarator = (numarator * (pow_mod( a, b + 1 ) - 1)) % MOD;
    numitor = (numitor * (a - 1)) % MOD;
  }

  fout = fopen( "sumdiv.out", "w" );
  fprintf( fout, "%d\n", (numarator * invMod( numitor )) % MOD );
  fclose( fout );

  return 0;
}