#include <bits/stdc++.h>
using namespace std;
long long INF = 1e9;
const int N = 210031;
long long fact[N];
long long invf[N];
long long pw(long long a, long long b) {
  if (b == 0) return 1;
  if (b % 2) return a * pw(a, b - 1) % 1000000007;
  return pw(a * a % 1000000007, b / 2);
}
long long inv(long long x) { return pw(x, 1000000007 - 2); }
long long C(long long n, long long m) {
  if (m > n) return 0;
  long long res = fact[n];
  res *= invf[n - m];
  res %= 1000000007;
  res *= invf[m];
  return res % 1000000007;
}
long long f, w, h;
long long c1, c2;
long long ans_u, ans_d;
long long get_ways(long long total_items, long long stacks, long long bound) {
  if (total_items == 0 && stacks == 0) return 1;
  if (stacks == 0) return 0;
  total_items -= stacks * bound;
  if (total_items < 0) return 0;
  return C(total_items + stacks - 1, stacks - 1);
}
int main() {
  ios_base::sync_with_stdio(0);
  fact[0] = 1;
  for (int i = 1; i < N; i++) {
    fact[i] = fact[i - 1] * i % 1000000007;
  }
  for (int i = 0; i < N; i++) {
    invf[i] = inv(fact[i]);
  }
  cin >> f >> w >> h;
  for (int ttl = 0; ttl <= f + w; ttl++) {
    for (int tp1 = 0; tp1 <= 1; tp1++) {
      if (tp1 == 0) {
        c1 = (ttl + 1) / 2;
        c2 = ttl - c1;
      } else {
        c2 = (ttl + 1) / 2;
        c1 = ttl - c2;
      }
      long long here = get_ways(f, c1, 1) * get_ways(w, c2, 1);
      here %= 1000000007;
      ans_d = (ans_d + here) % 1000000007;
    }
  }
  for (int ttl = 0; ttl <= f + w; ttl++) {
    for (int tp1 = 0; tp1 <= 1; tp1++) {
      if (tp1 == 0) {
        c1 = (ttl + 1) / 2;
        c2 = ttl - c1;
      } else {
        c2 = (ttl + 1) / 2;
        c1 = ttl - c2;
      }
      long long here = get_ways(f, c1, 1) * get_ways(w, c2, h + 1);
      here %= 1000000007;
      ans_u = (ans_u + here) % 1000000007;
    }
  }
  ans_d = inv(ans_d);
  cout << ans_u * ans_d % 1000000007 << endl;
  cin.get();
  cin.get();
  return 0;
}
