#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
long long modpow(long long a, long long b){
	long long ans = 1;
	while (b > 0){
		if (b % 2 == 1){
			ans *= a;
			ans %= MOD;
		}
		a *= a;
		a %= MOD;
		b /= 2;
	}
	return ans;
}
long long modinv(long long a){
	return modpow(a, MOD - 2);
}
vector<long long> mf = {1};
vector<long long> mfi = {1};
long long modfact(int n){
	if (mf.size() > n){
		return mf[n];
	} else {
		for (int i = mf.size(); i <= n; i++){
			long long next = mf.back() * i % MOD;
			mf.push_back(next);
			mfi.push_back(modinv(next));
		}
		return mf[n];
	}
}
long long modfactinv(int n){
	if (mfi.size() > n){
		return mfi[n];
	} else {
		return modinv(modfact(n));
	}
}
long long modbinom(int n, int k){
	if (n < 0 || k < 0 || k > n){
		return 0;
	} else {
		return modfact(n) * modfactinv(k) % MOD * modfactinv(n - k) % MOD;
	}
}
int main(){
  int N, M, K;
  cin >> N >> M >> K;
  if (N > M + K){
    cout << 0 << endl;
  } else {
    long long ans = modbinom(N + M, N);
    int a = N - K - 1, b = K + M + 1;
    ans -= modbinom(a + b, a);
    if (ans < 0){
      ans += MOD;
    }
    cout << ans << endl;
  }
}
// Author : Shivraj Ahirwar //

#pragma GCC optimize("O2")
#include <bits/stdc++.h> 
using namespace std; 
  
#define rep(i,n) for (int i = 0; i < n; ++i) 
#define rep1(i,n) for (int i = 1; i < n; ++i) 
#define REP(i,k,n) for (int i = k; i <= n; ++i) 
#define REPR(i,k,n) for (int i = k; i >= n; --i)
#define ll long long int
#define nx cout<<"\n";
#define mod 1e9+7


//===================================================================================================================================

int main()
{
    std::ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int tc = 1;
    // cin>>tc;
    while (tc--){  
		ll a,b,c;
		cin>>a>>b>>c;
		if(a*b>=0){
			if(a<0){
				if(c%2==0){
					if(a<b) cout<<">";
					else if(a>b) cout<<"<";
					else cout<<"=";
				}
				else{
					if(a<b) cout<<"<";
					else if(a>b) cout<<">";
					else cout<<"=";
				}
			}
			else{
					if(a<b) cout<<"<";
					else if(a>b) cout<<">";
					else cout<<"=";
			}
		}

		else{
				if(c%2==0){
					if(abs(a)<abs(b)) cout<<"<";
					else if(abs(a)>abs(b)) cout<<">";
					else cout<<"=";
				}
				else{
					if(a<b) cout<<"<";
					else if(a>b) cout<<">";
					else cout<<"=";
				}
		}
		// else{
		// 	if(c%2==0){
		// 			if(abs(a)<abs(b)) cout<<"<";
		// 			else if(abs(a)<abs(b)) cout<<">";
		// 			else cout<<"=";
		// 		}
		// 		else{
		// 			if(a<b) cout<<"<";
		// 			else if(a>b) cout<<">";
		// 			else cout<<"=";
		// 		}
		// }
		nx
    }
    return 0;
}