#include<vector>
#include<fstream>
#include<cstdlib>
#define Modulo 9901

/*
 *
 */
using namespace std;
typedef long long int lld;
char is_prime[1000000000/16+1];
vector< int > Prime;
void Sieve_of_Eratosthenes( lld Nmax )
{
	lld i, j;
	for( i=1; ((i*i)<<1)+(i<<1) <= Nmax; ++i )
		if( 0 == ( is_prime[i>>3] & ( 1<<(i&7) ) ) )
			for( j=((i*i)<<1)+(i<<1); (j<<1)+1 <= Nmax; j+=(i<<1)+1 )
				is_prime[j>>3]|=( 1<<(j&7) );
	Prime.push_back(2);
	for( i=1; (i<<1)+1 <= Nmax; ++i )
		if( 0 == ( is_prime[i>>3] & (1<<(i&7)) ) )
			Prime.push_back( (i<<1)+1 );
	Prime.push_back(100003);
}
inline lld pow( lld x, lld n ) //x^n
{
	if( 2 == x )
		return (1<<n);
	lld r=1;
	for( ; n; n>>=1 )
	{
		if( n&1 )
			r*=x;
		x*=x;
	}
	return r;
}
int main( void )
{
	lld A, B, s, nr, i, j;
	ifstream in( "sumdiv.in" );
	ofstream out( "sumdiv.out" );
	in>>A>>B;
	A=pow( A, B );
	Sieve_of_Eratosthenes( pow( A, (B+1)/2 )+1 );
	s=nr=1;
	for( i=0; 1LL*Prime[i]*Prime[i] <= A; ++i )
		if( 0 == A%Prime[i] )
		{
			for( j=0; 0 == A%Prime[i]; ++j, A/=Prime[i] );
			nr=( nr*j+nr )%Modulo;
			s=( s * ( pow( Prime[i], j+1 )-1 )/(Prime[i]-1) )%Modulo;
		}
	if( A > 1 )
	{
		nr*=2;
		s=( s * ( A+1 ) )%Modulo;
	}
	out<<s<<'\n';
	return 0;
}