#include <bits/stdc++.h>
using namespace std;
int c, h, w;
long long MOD = 1e6 + 3;
long long dp[128];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> c >> w >> h;
  c++;
  long long t = 1;
  for (int i = 0; i <= w; ++i) t = (t * h) % MOD;
  dp[0] = 1;
  dp[1] = 1;
  dp[2] = h + 1;
  for (int i = 2; i <= w + 1; ++i) dp[i] = (dp[i - 1] * dp[2]) % MOD;
  if (c <= w + 1) {
    cout << dp[c] << endl;
    return 0;
  }
  int j = w + 2;
  long long sum = dp[w + 1];
  while (j <= c) {
    int k = j % (w + 2);
    long long p = (t * dp[k]) % MOD;
    sum = (sum * (h + 1)) % MOD;
    sum = (((sum - p) % MOD) + MOD) % MOD;
    dp[k] = sum;
    j++;
  }
  cout << sum << endl;
  return 0;
}
