1008 [hnoi2008]越狱

#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
using namespace std;
typedef long long LL;
const LL Mod = 100003;
LL n,m;
LL (LL a,LL b){
	a%=Mod;;
	LL Ans = 1;
	for (;b;b>>=1,a=a*a%Mod){
		if (b&1) Ans=Ans*a%Mod;
	}
	return Ans;
}
int main(){
	scanf("%lld%lld",&m,&n);
	printf("%lldn",((Pow(m,n)-m*Pow(m-1,n-1)) % Mod + Mod) % Mod);
	
	return 0;
}