#include<bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll  long long
#define pb push_back
#define vec vector<ll>
#define pii pair<ll,ll>
#define pr_que priority_queue<pii,vector<pii>,greater<pii> >
#define itr(i,x,y) for(ll i=x;i<y;i++)
#define mod 1000000007
const long long N=2000001,INF=1000000000000000000;
const double err=1e-9;
ll fact[N];
ll mod_exp(ll a,ll n)
{
   if(n==0) return 1;
   ll val=mod_exp(a,n/2);
   if(n%2==0) return val*val%mod;
   else return val*val%mod*a%mod;
}
ll ncr(ll n,ll r)
{
   ll ans=fact[n];
   ans=ans*(mod_exp(fact[r],mod-2))%mod;
   ans=ans*(mod_exp(fact[n-r],mod-2))%mod;
   return ans;
}
int main()
{
	IOS;
	ll n,m,k;
	cin >> n >> m >> k;
	for(int i=0;i<=n+m;i++)
	{
	   if(i==0 || i==1) fact[i]=1;
	   else fact[i]=fact[i-1]*i%mod;
	}
	ll ans=0;
	if(n <= (m+k)) ans=(ncr(m+n,m)-ncr(m+n,n-1-k)+mod)%mod;
  
   cout << ans << endl;
	return 0;
}

#include <bits/stdc++.h>
#define endl '\n'
#define ll long long
#define rt(x) return cout<<x,0;
#define rt1(x) return cout<<x;
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define rrep(i, n) for(int i=n-1;i>=0;i--)
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
const auto EPS = 1e-9;
const ll MOD = 1e9 + 7;
void solve(){
    double x,y,z;
    cin>>x>>y>>z;
    double f=y/x;
    double c=f*z;
    if((c-(int)c)>EPS)
        cout<<(int)c;
    else
        cout<<(int)c-1;

}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
    	int t=1;//cin>>t;
    	while(t--){
        	solve();
    	}
	return 0;
}
