#include<bits/stdc++.h>
using namespace std;

#define endl        "\n"
#define LL          long long
#define READ(x)     freopen(x,"r",stdin)
#define WRITE(x)    freopen(x,"w",stdout)
#define BOOST       ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define pb          push_back
#define mem(x,y)    memset(x,y,sizeof x )
#define ch          printf("Came Here!!!!!!!!!!!!!!!\n")
#define deb(x)      cerr<<#x<<" :: "<<x<<" "
#define dnl         cerr<<endl;
#define FOR(i,n)    for(int i=0;i<n;i++)
#define cnd         tree[idx]
#define lc          tree[idx*2]
#define rc          tree[idx*2+1]
#define lnd         (2*idx),(b),( (b+e) /2 )
#define rnd         ((2*idx)+1),(((b+e)/2)+1),(e)
#define popcount    __builtin_popcount

//const LL        INF = 1LL<<59;
const double    PI = 2.0 * acos(0.0);

typedef pair<int,int>   pii;
typedef pair<LL,LL>     pll;
typedef vector<int>     vi;
typedef vector<LL>      vl;
typedef vector<pii>     vii;
typedef vector<pll>     vll;

//// Including Policy Based DS
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
/////cout<<*X.find_by_order(1)<<endl;
/////cout<<X.order_of_key(-5)<<endl;
//typedef tree<
//pll,
//null_type,
//less< pll >,
//rb_tree_tag,
//tree_order_statistics_node_update>
//ordered_set;

// Grid direction array [4]
int X[4]={0,0,-1,1};
int Y[4]={1,-1,0,0};
// Grid direction array [8]
int X8[8]={0,0,1,-1,-1,1,1,-1};
int Y8[8]={1,-1,0,0,-1,-1,1,1};
// Bishop direction array [8]
int BX[8]={0,0,1,-1,-1,1,1,-1};
int BY[8]={1,-1,0,0,-1,-1,1,1};
// Knight Direction Array
int KX[8] = {1,1,2,2,-1,-1,-2,-2};
int KY[8] = {2,-2,1,-1,2,-2,1,-1};

inline LL modMul(LL a, LL b,LL mod){
    LL ans = 0;
    a = a % mod;
    while (b > 0){
        if ( b % 2 )ans = (ans%mod+ a%mod) % mod;
        a = (a%mod * 2%mod) % mod;
        b /= 2;
    }
    return ans % mod;
}
inline LL power(LL a,LL b,LL mod){
    if(b==0)return 1LL%mod;
    LL x=power( a,b/2,mod );
    x = (x*x) % mod;
    if( b%2==1 )x = (x*a)%mod;
    return x%mod;
}

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());


//-------------------------------------------------------------------------------
//-------------------------------------------------------------------------------
const int mx = 234567;


void solve(int cs){
    int n,m;
    LL a,b,c;
    cin>>a>>b>>c;


    if( c%2==0 ){
        if( abs(a)==abs(b) )cout<<"=";
        else if( abs(a)<abs(b) )cout<<"<";
        else cout<<">";
    }
    else{

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

int main(){
    BOOST;
    #ifdef MujahidPC
        double start = clock();
//        READ("in.txt");
//        WRITE("out.txt");
    #endif

    int t;
    t = 1;
//    cin>>t;
    FOR(cs,t)solve(cs+1);

    #ifdef MujahidPC
        double tim = (clock() - start)/CLOCKS_PER_SEC;
        cerr<<"Running Time : "<<tim<<" \n";
    #endif
    return 0;
}


#include<iostream>
using namespace std;
//       {{{{{{{{{{{{{{{ SOLVER    :    SANGAM KUMAR }}}}}}}}}}}}}}}


#include<math.h>
#include<stdio.h>
#include <cstdlib>
#include <ctime>
#include<cmath>
#include<string.h>
#include<stdlib.h>
#include<bits/stdc++.h>
#define ll long long int
#define start ll _; cin>>_;  while(_--){ runtest();}
#define loop(j,n) for(ll h=j;h<n;h++)
#define var ll n,m,x,y,z,c,j,h,k;
#define array ll a[200004],b[200004];
#define ci cin
#define co cout
#define yes cout<<"YES\n";
#define no cout<<"NO\n";
#define nan cout<<"-1\n";
#define line cout<<"\n";
#define getarray cin>>n; ll a[200005]; loop(0,n){ ci>>a[h];}
#define putarray loop(0,n){ co<<a[h]<<" "; } 



// predefined functions 



ll lcm(ll a, ll b)
{
    ll k=(a*b)/(__gcd(a,b));
    return k;
}


bool isprime(ll n)
{
	 
	if (n <= 1)
		return false;
	if (n <= 3)
		return true;

	
	if (n % 2 == 0 || n % 3 == 0)
		return false;

	for (int i = 5; i * i <= n; i = i + 6)
		if (n % i == 0 || n % (i + 2) == 0)
			return false;

	return true;
}



ll fact(ll n)
{
    return (n == 1 || n == 0) ? 1 : n * fact(n - 1);
}



void runtest()
{
    var;
}

int main()
{
  //  start
  ll a,b,c;
  
  ci>>a>>b>>c;
  ll x=(ll)pow(a,c);
  ll y=(ll)pow(b,c);
  if(c%2==0)
  {
      if(abs(a)==abs(b))
      {
          co<<"=";
      }
      else if(abs(a)>abs(b))
      {
          co<<">";
      }
      else co<<"<";
  }
  else
  {
      if(a>b)
      {
          co<<">";
      }
      else if(a<b)
      {
          co<<"<";
      }
      else co<<"=";
  }
  
  

    return 0;
}