#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-7;
const int N = 500010;
const int M = 500010;
const int P = 1000000007;
const int Inf = 1000000007;
const int Fni = -1000000007;
inline int qr() {
  int r = 0, f = 1;
  char c = getchar();
  while (c > '9' || c < '0') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c <= '9' && c >= '0') {
    r = (r << 1) + (r << 3) + c - '0', c = getchar();
  }
  return r * f;
}
template <typename T>
void debug(T x, char c = '\n') {
  cerr << x << c;
}
template <typename T>
void debug(T *const tp, int minn, int maxn, char v = ' ', char c = '\n') {
  for (int i = minn; i <= maxn; ++i) debug(tp[i], v);
  cerr << c;
}
template <typename T>
inline void chkmin(T &x, T y) {
  x = x > y ? y : x;
}
template <typename T>
inline void chkmax(T &x, T y) {
  x = x < y ? y : x;
}
template <typename T>
inline void add(T &x, long long y, int mod = P) {
  x += y;
  x = x >= mod ? x - mod : x;
}
template <typename T>
inline void dec(T &x, long long y, int mod = P) {
  x -= y;
  x = x < 0 ? x + mod : x;
}
template <typename T>
inline T addn(T x, long long y, int mod = P) {
  x += y;
  return (x = x > mod ? x - mod : x);
}
template <typename T>
inline T decn(T x, long long y, int mod = P) {
  x -= y;
  return (x = x < 0 ? x + mod : x);
}
int res;
int ans;
int inv[N];
int fac[N];
int expow(int a, int b) {
  int ret = 1;
  while (b) {
    if (b & 1) ret = (long long)ret * a % P;
    a = (long long)a * a % P;
    b >>= 1;
  }
  return ret;
}
int binom(int x, int y) {
  return (long long)fac[x] * inv[y] % P * inv[x - y] % P;
}
void prework(int p, int q) {
  fac[0] = inv[0] = 1;
  ans = res = 0;
  for (int i = 1; i <= p + q + 1; ++i) fac[i] = 1ll * fac[i - 1] * i % P;
  inv[p + q + 1] = expow(fac[p + q + 1], P - 2);
  for (int i = p + q; i >= 1; --i) inv[i] = 1ll * inv[i + 1] * (i + 1) % P;
}
int p, q, h;
int main() {
  cin >> q >> p >> h;
  prework(p, q);
  int x, y, z;
  if (p == 0) return cout << 1 << '\n', 0;
  if (q == 0) {
    if (p > h)
      cout << 1 << '\n';
    else
      cout << 0 << '\n';
    return 0;
  }
  for (int i = 2; i <= p + q; ++i) {
    x = ceil(1.0 * i / 2.0);
    y = floor(1.0 * i / 2.0);
    z = 0;
    if (x <= p && y <= q)
      add(z, 1ll * binom(p - 1, x - 1) % P * binom(q - 1, y - 1) % P);
    if (x <= q && y <= p)
      add(z, 1ll * binom(q - 1, x - 1) % P * binom(p - 1, y - 1) % P);
    add(ans, z);
    z = 0;
    if (1ll * x * h <= p && y <= q)
      add(z, 1ll * binom(p - x * h - 1, x - 1) % P * binom(q - 1, y - 1) % P);
    if (1ll * y * h <= p && x <= q)
      add(z, 1ll * binom(p - y * h - 1, y - 1) % P * binom(q - 1, x - 1) % P);
    add(res, z);
  }
  if (p + q <= 1) res = 1, ans = 1;
  cout << 1ll * res * expow(ans, P - 2) % P << '\n';
  return 0;
}
