WA #6#8#10,悬关求调

#include <iostream>
#include <algorithm>
#define ll long long
using namespace std;
ll n,m;
int modd(ll a,ll b,ll p)
{
	ll ans=1;
	while(b)
	{
		if(b&1)
		{
			ans=ans*a%p;
		}
		a=a*a%p;
		b>>=1;
	}
	ll tans=ans%p;
	return tans;
}
int main()
{
    cin>>m>>n;
    ll ans=modd(m,n,100003)-m*modd(m-1,n-1,100003)%100003;
    cout<<ans%100003+100003%100003;
    return 0;
}