#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll I=1167167167167167167;
ll Q=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
template<class T> void print_tate(vector<T> &v) {rep(i,v.size()) cout<<v[i]<<"\n";}
void yneos(bool a){if(a) cout<<"Yes"<<"\n"; else cout<<"No"<<"\n";}

ll Range=2000000;
vector<ll> Kai(Range+1,1);
vector<ll> Kai_re(Range+1,1);
vector<ll> Kai_g(Range+1,1);
void Re(int potato){//Re(0)で初期化
  for(int i=1;i<=Range;i++){
    if(i!=1){
      Kai_g[i]=((Q-Q/i)*Kai_g[Q%i])%Q;
    }
    Kai_re[i]=(Kai_g[i]*Kai_re[i-1])%Q;
  }
  for(int i=1;i<=Range;i++){
    Kai[i]=(i*Kai[i-1])%Q;
  }
}
ll si(ll x,ll y){
	if(y<0) return 0;
  ll C;
  C=(Kai_re[y]*Kai_re[x-y])%Q;
  C=(C*Kai[x])%Q;
  return C;
}

//おちこんだりもしたけれど、私はげんきです。
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	ll N,M,K;
	cin>>N>>M>>K;
	Re(0);
	if(N>M+K) cout<<"0"<<endl;
	else cout<<(Q+si(N+M,N)-si(N+M,N-K-1))%Q<<endl;
}

#include <iostream>
#include <vector>
#include <algorithm>
#include <unordered_set>
#include <cstdlib>
#include <cfloat>
#include <cmath>
#include <queue>
#include <deque>
#include <set>
#define ll long long
#define lp pair<ll, ll>
#define max(a,b)((a)>(b)?(a):(b))
#define min(a,b)((a)<(b)?(a):(b))
#define ALL(obj) (obj).begin(), (obj).end()
using namespace std;

#define DIV 1000000007
//#define LLONG_MAX 9223372036854775807
//#define LLONG_MIN -9223372036854775808

int main(){
	ll i,j,n,a,b,c;
	cin >> a >> b >> c;
	
	if ((-1*a == b && c%2==0) || a == b) {
		cout << "=" << endl;//
	} else if (a == 0) {
		if (b < 0 && c%2 == 1) {
			cout << ">" << endl;
		} else {
			cout << "<" << endl;
		}//
	} else if(b==0) {
		if (a < 0 && c%2 == 1) {
			cout << "<" << endl;
		} else {
			cout << ">" << endl;
		}//
	} else if (a > 0 && b > 0) {
		if (a>b) {
			cout << ">" << endl;
		} else {
			cout << "<" << endl;
		}
	} else if (a > 0 && b < 0) {
		if (c%2 == 1) {
			cout << ">" << endl;
		} else {
			if (a > -1*b) {
				cout << ">" << endl;
			} else {
				cout << "<" << endl;
			}
		}//
	} else if (a < 0 && b > 0) {
		if (c%2 == 1) {
			cout << "<" << endl;
		} else {
			if (-1*a > b) {
				cout << ">" << endl;
			} else {
				cout << "<" << endl;
			}
		}//
	} else {//a<0 && b<0
		if (c%2==1) {
			if (-1*a > -1*b) {
				cout << "<" << endl;
			}else {
				cout << ">" << endl;
			}//
		} else {
			if (-1*a > -1*b) {
				cout << ">" << endl;
			}else {
				cout << "<" << endl;
			}
		}
	}
	
	
	
	return 0;
}