#include <bits/stdc++.h>
#define rep(i, n)	for(int i=0;i<(int)(n);i++)
#define ALL(a)	(a).begin(),(a).end()
using namespace std;
using ll=long long;
typedef pair<int,int> P;

const int MAX=2000005;
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(){
    int n,m,k;
    cin>>n>>m>>k;
    if(n>m+k){
        cout<<0<<endl;
        return 0;
    }
    COMinit();
    ll ans=COM(n+m,n)-COM(n+m,m+k+1);
    if(ans<0) ans+=MOD;
    cout<<ans<<endl;
}
#include <iostream>
using namespace std;

int main() {
    int A, B, W;
    cin >> A >> B >> W;
    W *= 1000;
    int m = 1000003;
    int M = -1;
    for (int i=1; i<=1000000;i++) {
        if (A * i <= W && B * i >= W) {
            m = min(m, i);
            M = max(M, i);}
    }
    if (m == 1000003 && M == -1) cout << "UNSATISFIABLE" << endl;
    else cout << m << ' ' << M << endl;
}