#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
  T ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
template <class T>
inline T lcm(T a, T b) {
  a = abs(a);
  b = abs(b);
  return (a / gcd(a, b)) * b;
}
template <class T, class X>
inline bool getbit(T a, X i) {
  T t = 1;
  return ((a & (t << i)) > 0);
}
template <class T, class X>
inline T setbit(T a, X i) {
  T t = 1;
  return (a | (t << i));
}
template <class T, class X>
inline T resetbit(T a, X i) {
  T t = 1;
  return (a & (~(t << i)));
}
inline long long power(long long a, long long b) {
  long long multiply = 1;
  for (int i = (1); i <= (b); i++) {
    multiply *= a;
  }
  return multiply;
}
inline long long ABS(long long a) { return (a >= 0) ? a : -a; }
long long f, w, h, fact[100010], inv[100010];
long long ways(long long n, long long r) {
  if (n < r || r <= 0) return 0;
  return (((fact[n - 1] * inv[r - 1]) % 1000000007LL) * inv[n - r]) %
         1000000007LL;
}
int main() {
  fact[0] = 1;
  for (long long i = (1); i <= (100009); i++)
    fact[i] = (i * fact[i - 1]) % 1000000007LL;
  for (int i = (0); i <= (100009); i++)
    inv[i] = modinverse(fact[i], 1000000007LL);
  scanf("%lld %lld %lld", &f, &w, &h);
  if (w == 0) {
    printf("1\n");
    return 0;
  }
  if (f == 0) {
    if (w > h)
      printf("1\n");
    else
      printf("0\n");
    return 0;
  }
  long long p = 0, q = 0;
  for (int i = (1); i <= (w + f); i++) {
    p += (ways(f, (i + 1) / 2) * ways(w - h * ((long long)(i / 2)), i / 2)) %
         1000000007LL;
    p += (ways(f, i / 2) *
          ways(w - h * ((long long)((i + 1) / 2)), (i + 1) / 2)) %
         1000000007LL;
    p %= 1000000007LL;
    q += (ways(f, (i + 1) / 2) * ways(w, i / 2)) % 1000000007LL;
    q += (ways(f, i / 2) * ways(w, (i + 1) / 2)) % 1000000007LL;
    q %= 1000000007LL;
  }
  long long ans = p * modinverse(q, 1000000007LL);
  ans %= 1000000007LL;
  cout << ans << '\n';
  return 0;
}
