#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long f, w, h, fact[200005], _fact[200005], up, down;
long long poww(long long a, long long n) {
  long long res = 1, now = a % mod;
  for (; n; n >>= 1, now = (now * now) % mod)
    if (n & 1) res = (res * now) % mod;
  return res;
}
void sieve() {
  fact[0] = 1;
  _fact[0] = poww(fact[0], mod - 2);
  for (long long i = 1; i < 200005; ++i) {
    fact[i] = (i * fact[i - 1]) % mod;
    _fact[i] = poww(fact[i], mod - 2);
  }
}
long long C(long long k, long long n) {
  if (k < 0 || n < 0) return 0;
  return ((fact[n] * _fact[n - k]) % mod * _fact[k]) % mod;
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> f >> w >> h;
  if (!h || !w) return cout << 1, 0;
  sieve();
  for (long long i = 1; i <= w; ++i) {
    long long rem = 2 * (f >= i ? C(i - 1, f - 1) : 0) +
                    (f >= i + 1 ? C(i, f - 1) : 0) +
                    (f >= i - 1 ? C(i - 2, f - 1) : 0);
    rem %= mod;
    down += ((w >= i ? C(i - 1, w - 1) : 0) * rem) % mod;
    down %= mod;
    long long m = w - h * i;
    up += ((m >= i ? C(i - 1, m - 1) : 0) * rem) % mod;
    up %= mod;
  }
  cout << (up * poww(down, mod - 2)) % mod;
  return 0;
}
