#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long ll;
const ll mod=100003;
ll n,m;
ll power_mod(ll a,ll b)
{
ll ans=1;
a=a%mod;
while (b)
{
if (b&1) ans=ans*a%mod;
a=a*a%mod;
b>>=1;
}
return ans;
}
int main()
{
scanf("%lld%lld",&m,&n);
ll ans1=power_mod(m,n);
ll ans2=m%mod*power_mod(m-1,n-1)%mod;
ll ans=((ans1-ans2)%mod+mod)%mod;
printf("%lld",ans);
return 0;
}