#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define fo(i,n) for(ll i=0;i<n;i++)
#define fo1(i,n) for(ll i=1;i<=n;i++)
#define loop(i,a,b)for(ll i=a;i<=b;i++)
#define loopr(i,a,b)for(ll i=b;i>=a;i--)
#define all(x) x.begin(), x.end()
#define sz(x) (ll)(x).size()
#define vll vector<ll> 
#define vvl vector<vll>
#define vpll vector<pll>
#define pll pair<ll,ll>
#define F first
#define S second
#define MOD 1000000007
ll max(ll a,ll b){if (a>b) return a; else return b;}
ll gcd(ll a, ll b){if(b==0)return a;return gcd(b, a%b);}
ll lcm(ll a, ll b){return a*b/gcd(a, b);}
ll fexp(ll a, ll b){ll ans = 1;while(b){if(b&1) ans = ans*a%MOD; b/=2;a=a*a%MOD;}return ans;}
ll inverse(ll a, ll p){return fexp(a, p-2);}
using namespace std;

//take care of long long

//fast I/O 
auto optimizer = []() {  // makes I/O fast
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  return 0;
}();

//seive
ll N = 1e5;
vll lpf(N+1,0);
void leastPrimeFactor()
{
    lpf[1] = 1;
    for (ll i = 2; i <= N; i++)
    {
        if(lpf[i] == 0)
        {
            lpf[i] = i;
            for (ll j = 2*i; j <= N; j += i)
            	if (lpf[j] == 0)
                	lpf[j] = i;
        } 
    }
}

int main()
{
	ll t=1;
	//cin>>t;
	while(t--)
	{
	    ll a,b,c;
	    cin>>a>>b>>c;
	    
	    if(c%2==0)
	    {
	        a=abs(a);
	        b=abs(b);
	        if(a>b)
	            cout<<">"<<endl;
	        else if(a==b)
	            cout<<"="<<endl;
	        else
	            cout<<"<"<<endl;
	    }
	    else
	    {
	        if(a<0 && b<0)
	        {
	            a=abs(a);
    	        b=abs(b);
    	        if(a<b)
    	            cout<<">"<<endl;
    	        else if(a==b)
    	            cout<<"="<<endl;
    	        else
    	            cout<<"<"<<endl;
	        }
	        else
	        {
	            if(a>b)
    	            cout<<">"<<endl;
    	        else if(a==b)
    	            cout<<"="<<endl;
    	        else
    	            cout<<"<"<<endl;
	        }
	    }
	    
	}
	return 0;
}
#include <iostream>
#include <cmath>

using namespace std;

int main()
{
	int A, B, C;
	cin >> A >> B >> C;

	bool signFlag1 = (C % 2 == 1) && (A < 0);
	bool signFlag2 = (C % 2 == 1) && (B < 0);

	char ans;
	if (signFlag1 != signFlag2) {
		ans = (signFlag1 ? '<' : '>');
	}
	else {
		if (abs(A) == abs(B)) {
			ans = '=';
		}
		else if (abs(A) < abs(B) ^ signFlag1) {
			ans = '<';
		}
		else {
			ans = '>';
		}
	}
	cout << ans << endl;

	return 0;
}
