rt

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 100003;
int ks(int a,int b){
	int ans = 1 % mod;
	a %= mod;
	while(b){
		if(b & 1){
			ans = (ans * a) % mod;
		}
		b >>= 1;
		a = (a * a) % mod;
 	}
 	return ans;
}
signed main(){
	int n,m;
	cin >> n >> m;
	int x = ks(m,n),y = m * ks(m - 1,n - 1);
	y %= mod;
	int ans = x - y;
	while(ans < 0){ans+=mod;}
	cout << ans;
}

样例输出3，我在想是不是公式套错了