BZOJ 1008 [HNOI2008]越狱

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int p=1e5+3;
long long quickpow(long long n,long long k){
long long ans=1;
for(n%=p;k;k>>=1,n=n*n%p)
if(k&1) ans=ans*n%p;
return ans;
}
int main(){
long long m,n,tot,no;
cin>>m>>n;
tot=quickpow(m,n);
no=(m%p)*(quickpow(m-1,n-1)%p)%p;
cout<<(tot+p-no)%p<<endl;
return 0;
}