#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
const int MOD = 1000003;
int i, j, k, m, n, l, C, W, H;
int ans;
int a[101][101], r[101][101], c[101][101];
int main() {
  long long N;
  cin >> N >> W >> H;
  n = W + 1;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) a[i][j] = (i == j);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < H + 1; j++) {
      int k = (j == 0) ? 0 : i + 1;
      if (k < n) r[i][k]++;
    }
  }
  while (N > 0) {
    if (N & 1) {
      memset(c, 0, sizeof(c));
      for (int k = 0; k < n; k++)
        for (int i = 0; i < n; i++)
          for (int j = 0; j < n; j++)
            c[i][j] = (c[i][j] + (long long)a[i][k] * r[k][j]) % MOD;
      for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++) a[i][j] = c[i][j];
    }
    N /= 2;
    memset(c, 0, sizeof(c));
    for (int k = 0; k < n; k++)
      for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
          c[i][j] = (c[i][j] + (long long)r[i][k] * r[k][j]) % MOD;
    for (int i = 0; i < n; i++)
      for (int j = 0; j < n; j++) r[i][j] = c[i][j];
  }
  for (int i = 0; i < n; i++) ans = (ans + a[0][i]) % MOD;
  cout << ans << endl;
  return 0;
}
