#include<bits/stdc++.h>

using namespace std;

const int N = 2000000 + 5, Mod = 1000000007;
int n = 0, m = 0, k = 0;
long long arr[N] = {}, x = 0, y = 0;

long long f(int num, int cnt){
	if(cnt == 0) return 1;
	long long temp = f(num, cnt / 2);
	if(cnt % 2 == 0) return (temp * temp) % Mod;
	else return ((temp * temp) % Mod) * num % Mod;
}

int main(){
	cin >> n >> m >> k;
	if(n > m + k){
		cout << 0;
		return 0;
	}
	arr[0] = 1;
	for(int i = 1 ; i <= m + n + 3 ; i ++) arr[i] = (arr[i - 1] * i) % Mod;
	x = (((arr[m + n] * f(arr[m], Mod - 2)) % Mod) * f(arr[n], Mod - 2)) % Mod;
	if(k != n) y = (((arr[m + n] * f(arr[m + k + 1], Mod - 2)) % Mod) * f(arr[n - k - 1], Mod - 2)) % Mod;
	cout << (x + Mod - y) % Mod;
	return 0;
}

#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>

#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
double pi=acos(-1);
#define ll long long
#define ull unsigned long long
#define pb push_back
#define PF push_front //deque
// #define mp make_pair
#define pq priority_queue
const ll mod=1000000007;
#define f first
#define s second
#define pii pair< ll, ll >
#define vi vector<int>
#define vpii vector<pii>
#define debug(v) for(auto i:v) cout<<i<<" ";
#define tc int t; cin >> t; while(t--)

// using namespace boost::multiprecision;
using namespace std;
void optimizeIO(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}


const int N=2000005;
ll fact[N],invfact[N];
ll power(ll x,ll y){
  if(y<=0) return 1LL;
  ll z=power(x,y/2);
  if(y%2) return (((z*z)%mod)*x)%mod;
  return (z*z)%mod;
}

void pre(){
  fact[0]=invfact[0]=invfact[1]=fact[1]=1;
  rep(i,2,N) fact[i]=(i*fact[i-1])%mod;
  rep(i,2,N) invfact[i]=(invfact[i-1]*power(i,mod-2))%mod;
}
ll nCr(ll n,ll k){ return (((fact[n]*invfact[n-k])%mod)*invfact[k])%mod; }



const int N1=1e6+1;
vector<int> isprime(N1,1),prime;
void seive(){
  rep(i,2,sqrt(N1)+1){
      if(isprime[i]){
        for(int j=i*i;j<N1;j+=i) isprime[j]=0;
        prime.pb(i);
      }
  }
  rep(i,sqrt(N1)+1,N1) if(isprime[i]) prime.pb(i);
}



struct dsu {
    vector<int> par, rank;
    dsu(int n): par(n+1), rank(n+1) {
        for (int i = 0; i <= n; i++) {
            par[i] = i;
            rank[i]= 1;
        }
    }
    int root(int a) {
        if (a == par[a]) return a;
        return par[a] = root(par[a]);
    }
    void merge(int a, int b) {
        a = root(a);
        b = root(b);
        if (a == b) return;
        if (rank[a] > rank[b]) swap(a, b);
        par[b] = a;
    }
    set<int> parent(int n){
        set<int> s;
        for(int i=1;i<=n;i++){
            s.insert(root(i));
        }
        return s;
    }
};
ll solve1(ll x,ll y){
  if(x<0 || y<0) return 0;
  return nCr(x+y,x);
}
void solve(){
  int n,m,k;
  cin>>n>>m>>k;
//  (0,0) to (m,n)
//  -k-1,k+1
  if(n>m+k) cout<<0<<endl;
  else cout<<(solve1(n,m)-solve1(n-(k+1),m-(-k-1))+mod)%mod<<endl;
}

int main(){
    optimizeIO();
    int r=1;
    pre();
    {solve();}
}
