
#include <algorithm>
#include <cmath>
// #include <cstdio>
// #include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#ifdef BUGS
#define PEEK(x) cout << #x << ": " << x << endl;
#else
#define PEEK(x) ;
#endif
using namespace std;
using ll = long long;
const int MAXN = 1e5 + 5;
const ll MOD = 1e9 + 7;
const int INF_32 = 0x3f3f3f3f;
const ll INF_64 = 0x3f3f3f3f3f3f3f3f;
// priority_queue<ll, vector<ll>, greater<ll>> minor_que;
ll n, m, k;
long long qpowMod(long long a, long long b, long long M) {
  long long res = 1;
  while (b) {
    if (b & 1) res = (res * a) % M;
    a = a * a % M;
    b >>= 1;
  }
  return res;
}
void scan_d(int &ret) {
  char c;
  ret = 0;
  while ((c = getchar()) < '0' || c > '9')
    ;
  while (c >= '0' && c <= '9') ret = ret * 10 + (c - '0'), c = getchar();
}
void scan_d(ll &ret) {
  char c;
  ret = 0;
  while ((c = getchar()) < '0' || c > '9')
    ;
  while (c >= '0' && c <= '9') ret = ret * 10 + (c - '0'), c = getchar();
}
void init() {
  ;
  ;
}
// C(2, 3) = C_5^3 = C_5^2 = 10
ll C(ll x, ll y) {
  if (x < 0 || y < 0) return 0;
  ll ret = 1;
  for (int i = 1; i <= x + y; ++i) {
    ret *= i;
    ret %= MOD;
  }
  for (int i = 1; i <= x; ++i) {
    ret *= qpowMod(i, MOD - 2, MOD);
    ret %= MOD;
  }
  for (int i = 1; i <= y; ++i) {
    ret *= qpowMod(i, MOD - 2, MOD);
    ret %= MOD;
  }
  return ret;
}
void solve(int casei) {
  // ...
  if (n > m + k) {
    printf("0\n");
  } else {
    // (M + N -> N) - (M + N -> K + 1 + M)
    // printf("%lld %lld\n", C(m, n), C(k + 1 + m, n - k - 1));
    printf("%lld\n", (C(m, n) + MOD - C(k + 1 + m, n - k - 1) + MOD) % MOD);
  }
}
int main() {
  int Case = 1;
  // scanf("%d", &Case);
  // ios::sync_with_stdio(false);
  // cin.tie(0);
  // cout.tie(0);
  // cin >> Case;
  for (int casei = 1; casei <= Case; ++casei) {
    scanf("%lld %lld %lld", &n, &m, &k);
    init();
    solve(casei);
  }
  return 0;
}

#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;

using vi=vector<int>;
using vvi=vector<vi>;
using LL=long long;
using vL=vector<LL>;
using vvL=vector<vL>;

const int MAX = 2000001;
const int MOD = 1000000007;

long long fac[MAX], finv[MAX], inv[MAX];

// テーブルを作る前処理
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}

// 二項係数計算
long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}



int main() {
    // 前処理
  COMinit();
  
  int n,m,k;
  cin>>n>>m>>k;
  
  if (n>m+k) {
    cout<<0<<endl;
  }
  else {
    cout<<( ( COM(n+m,n)-COM(n+m,m+k+1) )%MOD+MOD)%MOD<<endl;
  }
  

  

}