#include <bits/stdc++.h>
using namespace std;
const int inf = 2000000000;
const int md = 1000003;
int sum(int a, int b) {
  int first = a + b;
  if (first >= md) {
    first -= md;
  }
  return first;
}
int mult(int a, int b) {
  long long first = a;
  first *= b;
  if (first >= md) {
    first %= md;
  }
  return first;
}
const int N = 201;
const int M = 101;
int p[M], dp[N], s[M];
int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  int c, w, h;
  cin >> c >> w >> h;
  p[0] = 1;
  for (int i = 1; i <= w; i++) {
    p[i] = mult(p[i - 1], h);
  }
  dp[0] = 1;
  for (int i = 1; i <= c; i++) {
    if (i <= w + 2) {
      for (int j = 0; j <= w; j++) {
        if (j > i) break;
        if (i == j) {
          dp[i] = sum(dp[i], mult(dp[i - j], p[j]));
        } else {
          dp[i] = sum(dp[i], mult(dp[i - j - 1], p[j]));
        }
      }
    } else {
      int q = (i % N - 1);
      if (q < 0) {
        q += N;
      }
      int j = i % N - 1 - w - 1;
      if (j < 0) {
        j += N;
      }
      int first = (dp[q] - mult(dp[j], p[w]) + 2 * md) % md;
      dp[i % N] = sum(mult(first, h), dp[q]);
    }
  }
  cout << dp[c % N];
}
