#include<stdio.h>
#define mod 9901
long long a,b,s,c;
long long putere(long long x,long long n)
{if(n==1) return x%mod;
 if(n==0) return 1;
 long long p=putere(x,n/2);
 p=(p*p)%mod;
 if(n%2) return (x*p)%mod;
 else return p;}
long long div(long long a,long long b)
{long long d=2,s=1,d1,x,nr=0;
 while(a%d==0) {a=a/d;nr++;}
 nr=nr*b;
 if(nr) 
 {nr=putere(d,nr+1);
  nr=(mod+nr-1)%mod;
  s=(s*nr)%mod;}
 d=3;
 while(a!=1)
 {nr=0;
 while(a%d==0) {a=a/d;nr++;}
 nr=nr*b;
 if(nr) 
 {nr=putere(d%mod,nr+1);
  nr=(mod+nr-1)%mod;
  x=1;
  d1=(d-1)%mod;
  while((d1*x)%mod !=1) x++;
  nr=(nr*x)%mod;
  s=(s*nr)%mod;}
  d=d+2;}
return s;}

int main()
{freopen("sumdiv.in","r",stdin);
 freopen("sumdiv.out","w",stdout);
 scanf("%lld %lld",&a,&b);
 if(a==1||b==0) printf("1");
 else printf("%lld",div(a,b));
 fclose(stdout);
 return 0;}