#include<stdio.h>
#define mod 9901
using namespace std;
long long int a,b,i,s=1;
long long int putere( long long int a,long long int b)
{
	if(b==1)
		return a%mod;
	else
		if(b%2==0)
		{
			long long int x=putere(a,b/2);
			return x*x%mod;
		}
		else
			return a*putere(a,b-1)%mod;
}
int main()
{
	freopen("sumdiv.in","r",stdin);
	freopen("sumdiv.out","w",stdout);
	scanf("%lld %lld", &a, &b);
	for(i=1;i<=b;i++)
			s=s+putere(a,i)%mod;
	printf("%lld", s%mod);
	return 0;
}