#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f, maxn = 100005;
int fact[maxn], inv[maxn];
void init(int n = 1e5 + 1) {
  fact[0] = 1;
  for (int i = 1; i <= n; i++)
    fact[i] = (long long)i * fact[i - 1] % 1000000007;
  inv[1] = 1;
  for (int i = 2; i <= n; i++)
    inv[i] = 1000000007 -
             (long long)(1000000007 / i) * inv[1000000007 % i] % 1000000007;
  inv[0] = 1;
  for (int i = 1; i <= n; i++)
    inv[i] = (long long)inv[i - 1] * inv[i] % 1000000007;
}
int C(int n, int m) {
  if (m < 0 || m > n) return 0;
  return (long long)fact[n] * inv[m] % 1000000007 * inv[n - m] % 1000000007;
}
void add(int &x, int y) {
  x = x + y >= 1000000007 ? x + y - 1000000007 : x + y;
}
int Pow(int a, int b) {
  int ans = 1;
  while (b) {
    if (b & 1) ans = (long long)ans * a % 1000000007;
    a = (long long)a * a % 1000000007;
    b >>= 1;
  }
  return ans;
}
int main() {
  init();
  int f, w, h;
  while (~scanf("%d%d%d", &f, &w, &h)) {
    if (w == 0)
      printf("1\n");
    else {
      int p = 0, q = 0;
      for (int i = 1; i <= w; i++)
        add(q, (long long)C(f + 1, i) * C(w - 1, i - 1) % 1000000007);
      q = Pow(q, 1000000007 - 2);
      for (int i = 1; i <= w / (h + 1); i++)
        add(p, (long long)C(f + 1, i) * C(w - i * h - 1, i - 1) % 1000000007);
      printf("%d\n", (long long)p * q % 1000000007);
    }
  }
  return 0;
}
