#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#ifdef __GXX_EXPERIMENTAL_CXX0X__
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#ifdef __GXX_EXPERIMENTAL_CXX0X__
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;
#define mod 1000000007
#define mod2 998244353
#define pb push_back
#define ll long long
#define fi first
#define lb lower_bound
#define test ll int t;cin>>t;while(t--)
#define se second
#define pll pair<long long,long long>
#define icc ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
ll gcd(ll a, ll b){
    if(!a)return b;
    return gcd(b%a,a);
}
long long power(long long a,long long b){
    long long ans=1;
    while(b>0){
        if(b&1){ans=(ans*a);}
                a=(a*a);
                b>>=1;
        }
    return ans;
}
vector<ll> spf,prime;
void primes(ll n){
    spf.assign(n+1,0);
    spf[1] = 1;
    for(ll i=2; i<=n; i++){
        if (!spf[i]){
         spf[i]=i;prime.pb(i);
         for (ll j=i*i; j<=n; j+=i)
         if (!spf[j])
         spf[j] = i;
        }
    }
}
ll fact[1000001];
void factorial(ll n){
	fact[0]=1;
	for(ll i=1;i<=n;i++){
		fact[i]=fact[i-1]*i;
		if(fact[i]>=mod)
			fact[i]%=mod;
	}
}
priority_queue<ll,vector<ll>,greater<ll> > qqqqq;

void solve(){
   ll a,b,c;
   cin>>a>>b>>c;
   if(c&1){
       if(a>b)cout<<">";
       else if(a==b)cout<<"=";
       else cout<<"<";
   }
   else{
       if(abs(a)>abs(b))cout<<">";
       else if(abs(a)==abs(b))cout<<"=";
       else cout<<"<";
   }
}
int main(){
    icc;
    //test
    solve();
	return 0;
}
// ll op;
// 	cin>>op;
// 	for(ll fff=1;fff<=op;fff++){
        
// 		cout<<"Case #"<<fff<<": "<<ans<<endl;
// 	}

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int main() {
	ios::sync_with_stdio(false); cin.tie(0);
	int a, b, c;
	cin >> a >> b >> c;

	if(c % 2 == 0) {
		a = abs(a); 
		b = abs(b);
	}

	if(a == b) cout << "=";
	else cout << (a > b ? ">" : "<");
}