#include<iostream>
using namespace std;

int main() {
	int A, B, C;
	cin >> A >> B >> C;
	if (C % 2 == 1) {
		if (A <= 0 && B > 0) {
			cout << "<";
		}
		else if (B <= 0 && A > 0) {
			cout << ">";
		}
		else if (A > 0 && B > 0) {
			if (A > B) cout << ">";
			else if (A < B) cout << "<";
			else cout << "=";
		}
		else if (A <= 0 && B <= 0) {
			if (A > B) cout << ">";
			else if (A < B) cout << "<";
			else cout << "=";
		}
	}
	else {
		if (A <= 0 && B > 0) {
			if (A + B > 0)cout << "<";
			else if (A + B < 0)cout << ">";
			else cout << "=";
		}
		else if (B <= 0 && A > 0) {
			if (A + B > 0)cout << ">";
			else if (A + B < 0)cout << "<";
			else cout << "=";
		}
		else if (A > 0 && B > 0) {
			if (A > B) cout << ">";
			else if (A < B) cout << "<";
			else cout << "=";
		}
		else if (A <= 0 && B <= 0) {
			if (A > B) cout << "<";
			else if (A < B) cout << ">";
			else cout << "=";
		}
	}
}
/* Author :
	Drigesh Anuragi
*/

#include <bits/stdc++.h> 
using namespace std; 
  
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<n;i++)
#define repl(i,n) for(ll i=0;i<n;i++)
#define repl1(i,n) for(ll i=1;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define revl(i,n) for(ll i=n-1;i>=0;i--)
#define repn(i,n) for(int i=0;i<=n;i++)
#define repln(i,n) for(ll i=0;i<=n;i++)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vll vector<ll>
#define si set<int>
#define sll set<ll>
#define mpi map<int,int>
#define mpll map<ll,int>

#define trav(t) t.begin(),t.end()

#define lb lower_bound
#define up upper_bound
#define pb push_back
#define Mod 1000000007
 
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);


int prime_factors(int n) // Use int instead of ll to avoid TLE 
{
	int res=0;
	while (n % 2 == 0)
	{
		res++;
		n = n/2;
	}
	for (int i = 3; i <= sqrt(n); i = i + 2)
	{
		while (n % i == 0)
		{
			res++;
			n = n/i;
		}
	}
	if (n > 2)
		res++;
	return res;
}

/////////////////////////////////////////////////////////// Solve here //////////////////////////////////////////////////////

ll ncr(ll n,ll r){
	if(r==0) return 1;
	return n* ncr(n-1,r-1) / r ;
}

void solve(){
	
	int a,b,c;
	cin>>a>>b>>c;
	
	if(c%2){
		if(a==b) cout<<"=";
		else if(a<b) cout<<"<";
		else cout<<">";
	}
	else{
		ll aa = a;
		aa=abs(aa);
		ll bb = b;
		bb=abs(bb);
		if(aa==bb) cout<<"=";
		else if(aa<bb) cout<<"<";
		else cout<<">";
	}


	return ;
}

/////////////////////////////////////////////////////////////// MAIN FUNCTION //////////////////////////////////////////////////

int main(){
    fastio;
    int tc;
    tc=1;
    // cin>>tc;
    while(tc--){
    	solve();
    	if(tc) cout<<"\n";
    }
    
    return 0;
}