description: Monocarp wrote down two numbers on a whiteboard. Both numbers follow a specific format: a positive integer x with p zeros appended to its end.
  
  Now Monocarp asks you to compare these two numbers. Can you help him?
  
  Input
  
  The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of testcases.
  
  The first line of each testcase contains two integers x_1 and p_1 (1 ≤ x_1 ≤ 10^6; 0 ≤ p_1 ≤ 10^6) — the description of the first number.
  
  The second line of each testcase contains two integers x_2 and p_2 (1 ≤ x_2 ≤ 10^6; 0 ≤ p_2 ≤ 10^6) — the description of the second number.
  
  Output
  
  For each testcase print the result of the comparison of the given two numbers. If the first number is smaller than the second one, print '<'. If the first number is greater than the second one, print '>'. If they are equal, print '='.
  
  Example
  
  Input
  
  
  5
  2 1
  19 0
  10 2
  100 1
  1999 0
  2 3
  1 0
  1 0
  99 0
  1 2
  
  
  Output
  
  
  &gt;
  =
  &lt;
  =
  &lt;
  
  Note
  
  The comparisons in the example are: 20 > 19, 1000 = 1000, 1999 < 2000, 1 = 1, 99 < 100.
solution: //package codeforces.edu118;
  
  import java.io.*;
  import java.util.*;
  
  import static java.lang.Math.*;
  
  //Think through the entire logic before jump into coding!
  //If you are out of ideas, take a guess! It is better than doing nothing!
  //Read both C and D, it is possible that D is easier than C for you!
  
  //Be aware of integer overflow!
  //If you find an answer and want to return immediately, don't forget to flush before return!
  
  public class A {
      static InputReader in;
      static PrintWriter out;
  
      public static void main(String[] args) {
          //initReaderPrinter(true);
          initReaderPrinter(false);
          solve(in.nextInt());
          //solve(1);        
      }
  
      static void solve(int testCnt) {
          for (int testNumber = 0; testNumber < testCnt; testNumber++) {
              int x1 = in.nextInt(), p1 = in.nextInt(), x2 = in.nextInt(), p2 = in.nextInt();
              int d1 = Integer.toString(x1).length(), d2 = Integer.toString(x2).length();
              if(d1 + p1 < d2 + p2) out.println("<");
              else if(d1 + p1 > d2 + p2) out.println(">");
              else {
                  if(d1 < d2) {
                      for(int i = 0; i < d2 - d1; i++) {
                          x1 *= 10;
                      }
                  }
                  else if(d1 > d2) {
                      for(int i = 0; i < d1 - d2; i++) {
                          x2 *= 10;
                      }
                  }
                  if(x1 < x2) out.println("<");
                  else if(x1 > x2) out.println(">");
                  else out.println("=");
              }
          }
          out.close();
      }
  
      static void initReaderPrinter(boolean test) {
          if (test) {
              try {
                  in = new InputReader(new FileInputStream("src/input.in"));
                  out = new PrintWriter(new FileOutputStream("src/output.out"));
              } catch (IOException e) {
                  e.printStackTrace();
              }
          } else {
              in = new InputReader(System.in);
              out = new PrintWriter(System.out);
          }
      }
  
      static class InputReader {
          BufferedReader br;
          StringTokenizer st;
  
          InputReader(InputStream stream) {
              try {
                  br = new BufferedReader(new InputStreamReader(stream), 32768);
              } catch (Exception e) {
                  e.printStackTrace();
              }
          }
  
          String next() {
              while (st == null || !st.hasMoreTokens()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
  
          int nextInt() {
              return Integer.parseInt(next());
          }
  
          long nextLong() {
              return Long.parseLong(next());
          }
  
          double nextDouble() {
              return Double.parseDouble(next());
          }
  
          String nextLine() {
              String str = "";
              try {
                  str = br.readLine();
              } catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
  
          Integer[] nextIntArray(int n) {
              Integer[] a = new Integer[n];
              for (int i = 0; i < n; i++) a[i] = nextInt();
              return a;
          }
  
          int[] nextIntArrayPrimitive(int n) {
              int[] a = new int[n];
              for (int i = 0; i < n; i++) a[i] = nextInt();
              return a;
          }
  
          int[] nextIntArrayPrimitiveOneIndexed(int n) {
              int[] a = new int[n + 1];
              for (int i = 1; i <= n; i++) a[i] = nextInt();
              return a;
          }
  
          Long[] nextLongArray(int n) {
              Long[] a = new Long[n];
              for (int i = 0; i < n; i++) a[i] = nextLong();
              return a;
          }
  
          long[] nextLongArrayPrimitive(int n) {
              long[] a = new long[n];
              for (int i = 0; i < n; i++) a[i] = nextLong();
              return a;
          }
  
          long[] nextLongArrayPrimitiveOneIndexed(int n) {
              long[] a = new long[n + 1];
              for (int i = 1; i <= n; i++) a[i] = nextLong();
              return a;
          }
  
          String[] nextStringArray(int n) {
              String[] g = new String[n];
              for (int i = 0; i < n; i++) g[i] = next();
              return g;
          }
  
          List<Integer>[] readGraphOneIndexed(int n, int m) {
              List<Integer>[] adj = new List[n + 1];
              for (int i = 0; i <= n; i++) {
                  adj[i] = new ArrayList<>();
              }
              for (int i = 0; i < m; i++) {
                  int u = nextInt();
                  int v = nextInt();
                  adj[u].add(v);
                  adj[v].add(u);
              }
              return adj;
          }
  
          List<Integer>[] readGraphZeroIndexed(int n, int m) {
              List<Integer>[] adj = new List[n];
              for (int i = 0; i < n; i++) {
                  adj[i] = new ArrayList<>();
              }
              for (int i = 0; i < m; i++) {
                  int u = nextInt() - 1;
                  int v = nextInt() - 1;
                  adj[u].add(v);
                  adj[v].add(u);
              }
              return adj;
          }
  
          /*
              A more efficient way of building a graph using int[] instead of ArrayList to store each node's neighboring nodes.
              1-indexed.
           */
          int[][] buildGraph(int nodeCnt, int edgeCnt) {
              int[] end1 = new int[edgeCnt], end2 = new int[edgeCnt];
              int[] edgeCntForEachNode = new int[nodeCnt + 1], idxForEachNode = new int[nodeCnt + 1];
              for (int i = 0; i < edgeCnt; i++) {
                  int u = in.nextInt(), v = in.nextInt();
                  edgeCntForEachNode[u]++;
                  edgeCntForEachNode[v]++;
                  end1[i] = u;
                  end2[i] = v;
              }
              int[][] adj = new int[nodeCnt + 1][];
              for (int i = 1; i <= nodeCnt; i++) {
                  adj[i] = new int[edgeCntForEachNode[i]];
              }
              for (int i = 0; i < edgeCnt; i++) {
                  adj[end1[i]][idxForEachNode[end1[i]]] = end2[i];
                  idxForEachNode[end1[i]]++;
                  adj[end2[i]][idxForEachNode[end2[i]]] = end1[i];
                  idxForEachNode[end2[i]]++;
              }
              return adj;
          }
      }
  }