传送门biu~
用所有状态数m^n减去合法状态数m*(m-1)^(n-1)即为不合法状态数。
#include<bits/stdc++.h>
#define modd 100003
#define ll long long
using namespace std;
ll ksm(ll p,ll n){
ll re=1;
while(n){
if(n&1) (re*=p%modd)%=modd;
p=p*p%modd;
n>>=1;
}
return re;
}
int main(){
ll n,m;
scanf("%lld%lld",&m,&n);
ll ans=((ksm(m,n)-m*ksm(m-1,n-1))%modd+modd)%modd;
printf("%lld",ans);
return 0;
}