/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author NikuKyabe
 */

#include <iostream>
#include <fstream>

#include <bits/stdc++.h>

#define int long long
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i < i##_len; ++i)
#define REV(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define CLR(a, b) memset((a), (b), sizeof(a))
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define INF 1001001001001001001l
#define MOD 1000000007
#define fcout cout << fixed << setprecision(12)

using namespace std;

typedef pair<int, int> P;
template<class T>
using M =vector<vector<T>>;

class CPOW {
public:
	void solve(std::istream& cin, std::ostream& cout) {
       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;
       }
	}
};

signed main() {
	CPOW solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
	solver.solve(in, out);
	return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main(){
  int A, B, C;
  while(scanf("%d%d%d", &A, &B, &C) > 0){
    if(C%2 == 0){
      A = abs(A);
      B = abs(B);
    }

    if(A > B) printf(">");
    if(A < B) printf("<");
    if(A == B) printf("=");
    printf("\n");
  }
}
