#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 1e5 + 3;
int quiwe(int a, int k) {
int res = 1ll;
a %= mod;
while (k) {
if (k & 1) res = res * a % mod;
a = a * a % mod;
k >>= 1;
}
return res;
}
signed main() {
int n, m;
scanf("%lld%lld", &m, &n);
int ans = quiwe(m, n) - (m % mod) * quiwe(m - 1, n - 1) % mod;
while (ans < 0) ans += mod;
printf("%lld\n", ans % mod);
}
P3197 [HNOI2008] 越狱
最新推荐文章于 2025-06-03 19:56:39 发布