#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
template <typename T>
T gcd(T a, T b) {
  return b == 0 ? a : gcd(b, a % b);
}
template <typename T>
T LCM(T a, T b) {
  return a * (b / gcd(a, b));
}
template <typename T>
T expo(T base, T e, T mod) {
  T res = 1;
  while (e > 0) {
    if (e & 1) res = res * base % mod;
    base = base * base % mod;
    e >>= 1;
  }
  return res;
}
template <typename T, typename second>
T expo(T b, second e) {
  if (e <= 1) return e == 0 ? 1 : b;
  return (e & 1) == 0 ? expo((b * b), e >> 1) : (b * expo((b * b), e >> 1));
}
template <typename T, typename second>
T modinv(T a, second mod) {
  return expo(a, mod - 2, mod);
}
template <class T, class second>
std::ostream &operator<<(std::ostream &os, const std::pair<T, second> &t) {
  os << "(" << t.first << ", " << t.second << ")";
  return os;
}
template <class T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &t) {
  os << "[";
  for (__typeof(t.begin()) it = t.begin(); it != t.end(); it++) {
    if (it != t.begin()) os << ", ";
    os << *it;
  }
  os << "]";
  return os;
}
const int MAXN = 2e5 + 3;
long long fact[MAXN] = {0}, ifact[MAXN] = {0};
void preprocess() {
  fact[0] = (ifact[0] = 1);
  for (int i = 1; i < MAXN; i++) {
    fact[i] = (fact[i - 1] * i) % mod;
  }
  ifact[MAXN - 1] = modinv(fact[MAXN - 1], mod);
  for (long long i = MAXN - 2; i > 0; i--) {
    ifact[i] = (ifact[i + 1] * (i + 1)) % mod;
  }
  ifact[0] = 1;
  assert((fact[2] * ifact[2]) % mod == 1);
}
long long nCr(int n, int r) {
  return (fact[n] * ((ifact[n - r] * ifact[r]) % mod)) % mod;
}
long long go(long long n, long long k) {
  if (n == 0 and k == 0) return 1;
  return nCr(n + k - 1, k);
}
long long solve2(long long f, long long w, long long h) {
  long long res = 0;
  long long upper = w / (h + 1);
  for (long long x = 1; x <= upper; x++) {
    long long temp = 0;
    if (f - x >= 0) {
      temp += 2 * go(x, f - x);
    }
    if (f - x + 1 >= 0) {
      temp += go(x - 1, f - x + 1);
    }
    if (f - x - 1 >= 0) {
      temp += go(x + 1, f - x - 1);
    }
    temp %= mod;
    res += go(x, w - (h + 1) * x) * temp % mod;
    if (res >= mod) res -= mod;
  }
  return res;
}
long long solve(long long f, long long w, long long h) {
  if (w == 0) {
    return 1;
  }
  return solve2(f, w, h) * modinv(solve2(f, w, 0), mod) % mod;
}
int main() {
  ios_base::sync_with_stdio(false);
  preprocess();
  long long f, w, h;
  cin >> f >> w >> h;
  cout << solve(f, w, h) << endl;
  return 0;
}
