#include<stdio.h>
#define mod 9973
#include<bitset>
#define ll long long 

using namespace std;

int  pr[1000000],t;

struct nod
{
	ll nr,p;
}d[1000000];

bitset<1000100> c;

ll put(ll x)
{
	return x*x;
}

ll invmod(ll a,ll b)
{
	if(b==1) return a%mod;
	else if(b%2==1) return ( put( invmod(a, (b-1)/2 )) %mod *a%mod)%mod;
	return (put(invmod(a,b/2)))%mod;
}

void prelucreaza()
{
	ll n=0,b=0;
	int i=0,nd=1,sd=1;
	
	scanf("%lld %lld",&n,&b);
	
	for(i=1;pr[i]*pr[i]<=n;++i)
	{
		int nr=0;
		while(n%pr[i]==0)
		{
			n/=pr[i];
			nr++;
		}
		if(nr)
		{
			nd=invmod(pr[i],nr+1+b);
			sd*=((nd-1)%mod);
			sd%=mod;
			sd*=invmod(pr[i]-1,mod-2);
			sd%=mod;
		}
	}
	if(n>1)
	{
		nd=invmod(n,b+1);
		sd*=((nd-1)%mod);
		sd%=mod;
		sd*=invmod(n-1,mod-2);
		sd%=mod;
	}
	
	printf("%d\n",sd);
	
}

int main()
{
	freopen("sumdiv.in","r",stdin);
	freopen("sumdiv.out","w",stdout);
	
	for(int i=2;i<=1000000;++i)
		if(!c[i])
		{
			pr[++pr[0]]=i;
			for(int j=i+i;j<=1000000;j+=i)c[j]=1;
		}
	
	prelucreaza();
	
	fclose(stdin);
	fclose(stdout);
	
	return 0;
}