#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007, maxc = 500100;
inline long long ksm(long long a, long long b) {
  long long res = 1;
  for (; b; b >>= 1, a = 1ll * a * a % mod)
    if (b & 1) res = 1ll * res * a % mod;
  return res;
}
long long fac[maxc], invfac[maxc];
inline long long C(long long n, long long m) {
  return (n < 0 || m < 0 || n < m)
             ? 0
             : 1ll * fac[n] * invfac[m] % mod * invfac[n - m] % mod;
}
signed main() {
  fac[0] = 1;
  for (long long i = 1; i < maxc; i++) fac[i] = 1ll * fac[i - 1] * i % mod;
  invfac[maxc - 1] = ksm(fac[maxc - 1], mod - 2);
  for (long long i = maxc - 2; i >= 0; i--)
    invfac[i] = 1ll * invfac[i + 1] * (i + 1) % mod;
  long long ans = 0;
  long long f, w, h;
  scanf("%lld%lld%lld", &f, &w, &h);
  if (w == 0) return puts("1"), 0;
  for (long long i = 1; i <= f + 1; i++)
    (ans += 1ll * C(f + 1, i) * C(w - h * i - 1, i - 1) % mod) %= mod;
  ans = 1ll * ans * ksm(C(f + w, w), mod - 2) % mod;
  printf("%lld", ans);
  return 0;
}
