传送门:http://www.lydsy.com/JudgeOnline/problem.php?id=1008
用全部情况减去不会发生越狱的情况即可
mn−m∗(m−1)n−1
#include<stdio.h>
#define mod 100003
typedef long long ll;
int m;ll n;
inline int qp(int a,ll b)
{
int rt=1;
for (;b;b>>=1,a=(ll)a*a%mod) if (b&1) rt=(ll)rt*a%mod;
return rt;
}
int main()
{
scanf("%d%lld",&m,&n);
printf("%d",((qp(m,n)-(ll)m*qp(m-1,n-1))%mod+mod)%mod);
}