#include <cstdio>
#include <cassert>
using namespace std;

const int mod = 100003;

int power(int a, int b, int p) { // calculate (a ^ b) mod p
  int ans = 1;
  a = a % p;
  b = b % p;
  for (; b; b >>= 1) {
    if (b & 1) ans = (long long)ans * a % p;
    a = (long long)a * a % p;
  }
  return ans;
}

int main() {
  // freopen("input.txt", "r", stdin);
  int n, m;
  scanf("%d %d", &m, &n);
  int ans = (power(m,n,mod)-((power(m-1,n-1,mod)*m)%mod)+mod)%mod;
  printf("%d\n", ans);
  return 0;
}

求助, 我不理解我都用了快速幂了咋会超时. 还有, 我看帖子们指出 WA 是因为没有 +mod, 但是我加了 mod, 咋还是错的?