1618：越狱（快速幂）

m=2 n=3 result=2³-2=2³-(2*)1³
m=3 n=3 result=3³-12=2³-(3*)2²
m=3 n=4 result=3⁴-24=2³-(3*)2³
mⁿ-m*(m-1)^(n-1)

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod=100003;

ll ksm(ll a,ll b){
	ll result=1;
	while(b){
		if(b%2==1){
			result=result*a%mod;
			b--;
		}
		a=a*a%mod;
		b/=2;
	}
	return result;
}

int main(){
	ll m,n;
	cin>>m>>n;
	cout<<(ksm(m,n)-m*ksm(m-1,n-1)%mod+mod)%mod<<endl;
	//m*ksm(m-1,n-1)%mod防止m*ksm(m-1,n-1)>mod
	//+mod是为了防止为负
	return 0;
}