#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb emplace_back 
#define mp make_pair
#define fi first
#define se second
#define all(v) v.begin(),v.end()
#define run ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0);
#define mod 1000000007
#define decimal(k) cout<<fixed<<setprecision(k)<<endl
#define LL_MAX LLONG_MAX
#define yes cout<<"Yes"<<endl
#define no cout<<"No"<<endl
int exp(int x,int y){int res=1;x=x%mod;while(y>0){if(y&1)res=(res*x)%mod;y=y>>1;x=(x*x)%mod;}return res;}
int modinv(int x){return exp(x,mod-2);}
int add(int a,int b){a%=mod,b%=mod;a=((a+b)%mod+mod)%mod;return a;}
int sub(int a,int b){a%=mod,b%=mod;a=((a-b)%mod+mod)%mod;return a;}
int mul(int a,int b){a%=mod,b%=mod;a=((a*b)%mod+mod)%mod;return a;}
int gcd(int a, int b){if (b == 0)return a; return gcd(b, a % b);}
int Log2n( int n){ return (n > 1) ? 1 + Log2n(n / 2) : 0;} 
int fac[100009];int ncr_mod(int n,int k){int ans=fac[n];ans*=modinv(fac[k]);ans%=mod;ans*=modinv(fac[n-k]);ans%=mod;return ans;}
vector<int>v_prime;void Sieve(int n){bool prime[n + 1];memset(prime,true,sizeof(prime));for (int p = 2; p*p <=n;p++){if(prime[p] ==true) {for(int i = p*p; i<= n; i += p)prime[i]=false;}}for(int p = 2;p<= n;p++)if (prime[p])v_prime.pb(p);}
vector<int>v_factor;void factors(int n){ for (int i=1; i<=sqrt(n); i++) {if (n%i == 0) {if (n/i == i) v_factor.pb(i);else { v_factor.pb(i),v_factor.pb(n/i);};} } sort(all(v_factor)); } 
void out(vector<int>&a){for(int i=0;i<a.size();i++) cout<<a[i]<<" ";  cout<<endl;} 

bool convertOpposite(string str)
{
    int ln = str.length();
 
    // Conversion according to ASCII values
    for (int i = 0; i < ln; i++) {

             if(i%2==0)
             { 
               if (str[i] >= 'a' && str[i] <= 'z')
               {

               }
                 
                 else
                 return false;
             }
      
             if(i%2==1)
             { 
                    if (str[i] >= 'A' && str[i] <= 'Z')
                    {

                    }

                    else
                    return false;
            
             }
    }
    return true;
}

signed main()
 {


       run;


/*
open for mod factorial

     fac[0]=1;
       for(int i=1;i<100009;i++)
      {
         fac[i]=fac[i-1]*i; 
          fac[i]%=mod;  
      }
 */


/*
for sieve open this and use v_prime

       int pp=pow(10,6)+100000; 
          Sieve(pp);

*/


 // USE v_factor For calculating factors                       


int  t=1;
 //cin>>t;
 while(t--)
{
         // vector< pair <int,int> > vp; 
        //  map<int,int>mp; // x.second-->frequency
       //   set<int>st;


          int  n,i,x,y,ok=0,sum=0,ans=0,j,k,cnt=0,m,c=0;
          int  h[100009]={0};
          string s;
          cin>>s;
          if(convertOpposite(s)==true)
            yes;

            else
            no;


             
}
}
// Etavioxy
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#define il inline
#define ll long long
#define rep(i,s,t) for(register int i=(s);i<=(t);i++)
#define rev_rep(i,s,t) for(register int i=(s);i>=(t);i--)
#define each(i,u) for(int i=head[u];i;i=bow[i].nxt)
#define file(s) freopen(s".in" ,"r",stdin),freopen(s".out","w",stdout)
#define pt(x) putchar(x)
using namespace std;

const int mod = 1e9+7;

il ll qpow(ll a,ll b){
	ll ans= 1;
	for(; b; b>>=1,a=a*a%mod) if( b&1 ){
		ans= ans*a%mod;
	} return ans;
}
il ll inv(ll x){ return qpow(x,mod-2); }
il ll comp(ll n,ll m){
	if( m>n-m ) m = n-m;
	if( n<0 or m<0 ) return 0;
	ll up=1, down=1;
	rep(i,1,m){
		up = (up*(n-i+1))%mod;
		down = (down*i)%mod;
	}
	return up*inv(down)%mod;
}

int main(){
	int n,m,k;
	cin>>n>>m>>k;
	if( n>m+k ){ cout<<0<<endl; return 0; }
	cout<<((comp(n+m,n)-comp(n+m,n-k-1))%mod+mod)%mod<<endl;
	return 0;
}
