#include <bits/stdc++.h>
#include <math.h>
using namespace std;
using ll = long long;

int main(){
    ll a, b, c;
    cin >> a >> b >> c;
    if(c % 2 == 0){
        if(abs(a) < abs(b)){
            cout << "<" << endl;
        }else if(abs(a) > abs(b)){
            cout << ">" << endl;
        }else{
            cout << "=" << endl;
        }
    }else{
        if(a < b){
            cout << "<" << endl;
        }else if(a > b){
            cout << ">" << endl;
        }else{
            cout << "=" << endl;
        }
    }
}
#include <bits/stdc++.h>
using namespace std;

#define nl "\n"
#define fi first
#define se second
#define ll long long
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define rnd(x) cout<<setprecision((int)(x)+1)
#define f(i,n) for(int i = 0;i <(int)(n);++i)
#define fr(i,n) for(int i = (int)(n) - 1;i>=0;i--)
#define rep(i,a,b) for(int i = (int)(a); i<=(int) (b); ++i)
#define repr(i,a,b) for(int i = (int)(b); i>=(int) (a); i--)

typedef vector<int> vi;
typedef pair<int, int> pi;

#ifndef ONLINE_JUDGE
#define debug(x) cerr<<#x<<" = ";_print(x); cerr<<endl;
#else
#define debug(x)
#endif

template<class T> int cnt1(T n){
    int cnt=0;
    while(n>0){cnt++;n = n&(n-1);}
    return cnt;
}

template<class T> void _print(T a){
    cerr<<a; 
}

template<class T> void _print(vector<T> vi){
    cerr<<"[ ";
    for(T i:vi){ _print(i); cerr<<" ";}
    cerr<<"]"; 
}

const int MAX_N = 1e5 + 1;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;

void Solve(){
	int a,b,c;
	cin>>a>>b>>c;
	char s = '=';
	if(c%2==0){
		a = abs(a);
		b = abs(b);
	}
	if(a>b)
		s = '>';
	else if(a<b)
		s = '<';
	cout<<s<<nl;

}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    #ifndef ONLINE_JUDGE
        freopen("in.txt","r",stdin);
        freopen("output.txt","w",stdout);
        freopen("error.txt","w",stderr);
    #endif
    int t = 1;
    //cin>>t;
    rep(i,1,t)Solve();
}