#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<stdio.h>

using ll=long long;
constexpr int mod=1000000007;
int N,M,K,inv[2000000]={1,1};
int main(){
  for(int i=2;i<2000000;++i)inv[i]=ll(inv[mod%i])*(mod-mod/i)%mod;
  for(int i=2;i<2000000;++i)inv[i]=ll(inv[i])*inv[i-1]%mod;

  scanf("%d %d %d",&N,&M,&K);
  int p=1;
  for(int i=2;i<=N+M;++i)p=ll(p)*i%mod;
  int ans=ll(p)*inv[N]%mod*inv[M]%mod;
  if(N+M<=K||N==K){
    printf("%d\n",ans);
    return 0;
  }
  if(N>M+K){
    puts("0");
    return 0;
  }
  ++K;
  ans-=ll(p)*inv[N-K]%mod*inv[M+K]%mod;
  if(ans<0)ans+=mod;
  printf("%d\n",ans);
}
#include <bits/stdc++.h>
#include <random>
#include <chrono>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;
//mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T> void _do(T x){cerr<<x<<"\n";}
template<typename T,typename ...U> void _do(T x,U ...y){cerr<<x<<", ";_do(y...);}
#define dbg(...) cerr<<#__VA_ARGS__<<" = ";_do(__VA_ARGS__);

const int MOD1=1e9+7;
const int MOD2=998244353;
const ll INF=2e18;
const ld PI=3.14159265358979323846;
ll gcd(ll a,ll b){if(b==0) return a; return gcd(b,a%b);}
ll fpow(ll a,ll b,ll m)
{
    if(!b) return 1;
    ll ans=fpow(a*a%m,b/2,m);
    return (b%2?ans*a%m:ans);
}
ll inv(ll a,ll m) {return fpow(a,m-2,m);}

#define MottoHayaku ios::sync_with_stdio(false);cin.tie(0);
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep1(i,n) for(ll i=1;i<=n;i++)
#define repk(i,m,n) for(int i=m;i<n;i++)
#define F first
#define S second
#define pb push_back
#define SZ(a) ((ll)a.size())
#define reset(a) memset(a,0,SZ(a))
#define cd(a,b) ((a+b-1)/b)
#define pow2(a) (1LL<<a)
#define LB(a,x) (lower_bound(a.begin(),a.end(),x))
#define LPOS(a,x) (lower_bound(a.begin(),a.end(),x)-a.begin())
#define UB(a,x) (upper_bound(a.begin(),a.end(),x))
#define UPOS(a,x) (upper_bound(a.begin(),a.end(),x)-a.begin())
#define uni(c) c.resize(distance(c.begin(),unique(c.begin(),c.end())))
#define unisort(c) sort(c.begin(),c.end()),uni(c)
ll fac[2000005];
int main()
{
    MottoHayaku
    ll n,m,k;
    cin>>n>>m>>k;
    if(n>m+k)
    {
        cout<<"0\n";
        return 0;
    }
    fac[0]=1;
    rep1(i,n+m) fac[i]=fac[i-1]*i%MOD1;
    ll a=fac[n+m]*inv(fac[n],MOD1)%MOD1*inv(fac[m],MOD1)%MOD1;
    ll b;
    if(n+m<m+k+1) b=0;
    else b=fac[n+m]*inv(fac[m+k+1],MOD1)%MOD1*inv(fac[n-k-1],MOD1)%MOD1;
    cout<<(a-b+MOD1)%MOD1<<"\n";
}
