#include <iostream>
#include <math.h>
using namespace std;


int main(){
int 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;}

return 0;
}

#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define eb emplace_back
#define mk make_pair
using namespace std;
void vec(vector<int> & v){

    for(int i = 0;i<v.size() ; i++){
        cout<<v[i]<< " ";
    }
    cout<<endl;
}
void vec_ll(vector<long long int> & v){

    for(int i = 0;i<v.size() ; i++){
        cout<<v[i]<< " ";
    }
    cout<<endl;
}
void vec_ull(vector<ull> & v){

    for(int i = 0;i<v.size() ; i++){
        cout<<v[i]<< " ";
    }
    cout<<endl;
}
int parsestring(string temp){
    int num= 0;
    int digs = temp.size() - 1;
    for(int i = 0 ;i<=digs;i++){
        num += pow(10 , digs -i)*(temp[i] - '0');
    }
    return num;
}

ll divs(int a){
  int ans = 0;
  for(int i = 1;i<=int(pow(a , 0.5)) ; i++){
    if(a%i == 0){
      if(a /i == i){ans++;}
      else{ans += 2;}
    }
  }
  return ans;
}

ll divs_num(ll a){
  ll ans = 0;
  for(int i = 1;i<=int(pow(a ,0.5)) ;i++){
    if(a % i == 0){
      if(a/i == i){ans++;}
      else{ans+=2;}
    }
  }
  return ans;
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    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 >=0 && b >=0)){
        if(abs(a) > abs(b)){cout<<'>'<<endl;}
        else if(abs(a) == abs(b)){cout<<'='<<endl;}
        else{cout<<'<'<<endl;}
      }
      else if(a< 0 && b < 0){
        if(abs(a) > abs(b)){cout<<'<'<<endl;}
        else if(abs(a) == abs(b)){cout<<'='<<endl;}
        else{cout<<'>'<<endl;}
      }
      else{
        if(a<0){
          cout<<'<'<<endl;
        }
        else if(b < 0){
          cout<<'>'<<endl;
        }
      }
    }
  }