#include <bits/stdc++.h>
#include <climits>

using namespace std;

template<class T>
using V = vector<T>;
template<class T>
using VV = V<V<T>>;

using ld = long double;
#define ll long long
using ull = unsigned ll;
using PLL = pair<ll, ll>;
using VLL = V<ll>;
using VB = V<bool>;
using VVB = VV<bool>;
using VVLL = VV<ll>;
using Gr = VVLL;
using MLL = map<ll, ll>;
#define UMLL unordered_map<ll, ll, custom_hash>

#define fast ios_base::sync_with_stdio(0); cin.tie(nullptr); cout.tie(nullptr); cerr.tie(nullptr);

#define R &
#define CR const R

#define FORI(i, a, b) for(ll i = a, max##i = b; i < max##i; ++i)
#define FOR(i, n) FORI(i, 0, n)
#define RFORI(i, a, b) for(ll i = a, min##i = b; i >= min##i; --i)
#define RFOR(i, n) RFORI(i, n, 0)
#define FORA(i, a) for(auto i : a)
#define FORAR(i, a) for(auto R i : a)
#define FORACR(i, a) for(auto CR i : a)
#define ALL(obj) begin(obj), end(obj)
#define Count(q) while(q--)
#define OK cerr << "OK\n";

#define mp make_pair
#define pb push_back

//#define DEBUG

template<class T>
T sqr(T x)
{
    return x * x;
}

void YES(bool g, ostream R os, bool upper = true)
{
    if(g)
        if(upper)
            os << "YES";
        else
            os << "Yes";
    else
        if(upper)
            os << "NO";
        else
            os << "No";

    os << "\n";
}

template<class T>
void show(T CR t, ostream R os = cerr)
{
    FORACR(i, t)
        os << i << " ";
    os << "\n";
}

template<class T>
void show2d(T CR t, ostream R os = cerr)
{
    FORACR(i, t)
        show(i, os);
    os << "\n";
}

constexpr ll MOD = 1e9 + 7; //998244353;
constexpr ll len = 'z' - 'a' + 1;

constexpr ll INF = 1e18, MINF = -INF;

constexpr ld PI = atanl(1.0L) * 4;
constexpr ld eps = 1e-9, EPS = 1e-9;

struct custom_hash
{
    static uint64_t splitmix64(uint64_t x)
    {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator() (uint64_t x) const
    {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

//arr
void init() {}

ll sgn(ll a)
{
    if(a > 0)
        return 1;
    if(a < 0)
        return -1;
    return 0;
}

void solve(istream R is, ostream R os)
{
    ll a, b, c;
    is >> a >> b >> c;

    ll x = pow(sgn(a), c), y = pow(sgn(b), c);
    if(x < y)
        os << "<";
    else if(x > y)
        os << ">";
    else
    {
        a = abs(a);
        b = abs(b);

        if(a > b)
            os << ">";
        else if(a < b)
            os << "<";
        else
            os << "=";
    }
}

void tester(istream R is, ostream R os)
{
    auto seed = time(nullptr);
    //cerr << "seed: " << seed << "\n";
    srand(seed);
    fast
    init();
    ll q = 1;
    //is >> q;

    os << setprecision(999);
    Count(q)
        solve(is, os);
}

int main()
{
    ifstream in("input.txt");
    ofstream out("output.txt");

    tester(cin, cout);
}

#include <bits/stdc++.h>
using namespace std;
//using Graph = vector<vector<long long>>;
using Graph = vector<vector<int>>;
const long long INF = 1LL <<59;
const long long Mo=1000000007;
     
//vector<long long> seen;
vector<int> seen;
 
long long dfs(const Graph &G, int v, long long cnt) {
  seen[v] = cnt;	//判定だけならcntをboolに
  // v から行ける各頂点 next_v について
  for (auto next_v : G[v]) {
    if (seen[next_v]>=0) continue; // next_v が探索済だったらスルー
    dfs(G, next_v, cnt+1); // 再帰的に探索
  }
  //cout<<grp<<" "<<cnt<<endl;
  return 0;
}
     
long long gcn(long long x,long long y){
  if(x%y==0){
    return y;  
  }
  else{
    return gcn(y,x%y);
  }
}
     
long long modpow(long long a, long long n, long long mod) {
  long long res = 1;
  while (n > 0) {
    if (n & 1) res = res * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}  
int main(void){
  long long res,tmp,tmp1,tmp2,cnt,idx,cur,prev;
  long long flg;
  long long i,j,n,k,l;
  long long 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;
    }
    return 0;
  }
  else{
    if(a>b){
      cout<<">"<<endl;
    }
    else if(a<b){
      cout<<"<"<<endl;
    }
    else{
      cout<<"="<<endl;
    }
    return 0;
  }
       

  //cout<<res<<endl;
  //cout<<setprecision(15)<<t<<endl;
  //cout<<res<<endl;
      
  return 0;
}
 
/*
Graph G(n);
seen.assign(n,-1);
for(i=0; i<m; i++) {
  cin>>tmp1>>tmp2;
  tmp1--;
  tmp2--;
  G[tmp1].push_back(tmp2);
  G[tmp2].push_back(tmp1);
}
*/