#include<cstring>
#include<string>
#include<vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<list>
#include<set>
#include<map>
#include<complex>
#include<sstream>
#include<climits>
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define comp >
#define all(X) (X).begin(),(X).end()
#define pb push_back
#define mp make_pair
#define fi first
#define sc second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

const int MAX_N = 100;
int n;
int a[MAX_N], b[MAX_N];

int main() {
  scanf("%d", &n);
  rep(i,n) scanf("%d%d", a+i, b+i);

  rep(i,n) {
    if (a[i] == b[i]) cout << '=' << endl;
    else if (a[i] comp b[i]) cout << '>' << endl;
    else cout << '<' << endl;
  }

  return 0;
}