#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void rread(T& num) {
  num = 0;
  T f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') num = num * 10 + ch - '0', ch = getchar();
  num *= f;
}
const int inf = 0x3f3f3f;
const int maxn = 2e5 + 100, mod = 1e9 + 7, mod2 = 1e6 + 7;
const double pi = acos(-1);
long long gcd(long long a, long long b) { return (a ? gcd(b % a, a) : b); }
void exgcd(long long a, long long b, long long& d, long long& x, long long& y) {
  if (!b) {
    d = a;
    x = 1;
    y = 0;
  } else {
    exgcd(b, a % b, d, y, x);
    y -= x * (a / b);
  }
}
long long power(long long a, long long n) {
  long long p = 1;
  while (n > 0) {
    if (n % 2) {
      p = p * a;
    }
    n >>= 1;
    a *= a;
  }
  return p;
}
long long power(long long a, long long n, long long mod) {
  long long p = 1;
  while (n > 0) {
    if (n % 2) {
      p = p * a;
      p %= mod;
    }
    n >>= 1;
    a *= a;
    a %= mod;
  }
  return p % mod;
}
int n, k, x;
long long ni[maxn], jie[maxn];
long long c(long long i, long long j) {
  if (i < j || i < 0 || j < 0) return 0;
  return jie[i] * ni[j] % mod * ni[i - j] % mod;
}
int main() {
  jie[0] = 1;
  ni[0] = 1;
  for (int i = 1; i <= 2e5; i++)
    jie[i] = jie[i - 1] * i % mod, ni[i] = power(jie[i], mod - 2, mod);
  while (~scanf("%d%d%d", &n, &k, &x)) {
    long long ans = 0, sum = 0;
    if (k == 0) {
      cout << 1 << endl;
      continue;
    }
    if (n == 0) {
      if (k > x)
        cout << 1 << endl;
      else
        cout << 0 << endl;
      continue;
    }
    for (int i = 1; i <= max(n, k); i++) {
      ans = (ans + (c(n - 1, i - 1) * 2 + c(n - 1, i - 2) + c(n - 1, i)) % mod *
                       c(k - (long long)i * x - 1, i - 1) % mod) %
            mod;
      sum = (sum + (c(n - 1, i - 1) * 2 + c(n - 1, i - 2) + c(n - 1, i)) % mod *
                       c(k - 1, i - 1) % mod) %
            mod;
    }
    printf("%lld\n", ans * power(sum, mod - 2, mod) % mod);
  }
  return 0;
}
