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: import java.io.*;
  import java.util.*;
  import java.math.BigInteger;
  
  public class Main 
  {
      InputStream is;
      FastWriter out;
      String INPUT = "";
  
      void run() throws Exception
      {
          is = System.in;
          out = new FastWriter(System.out);
          
          long s = System.currentTimeMillis();
          solve();
          out.flush();
          tr(System.currentTimeMillis()-s+"ms");
          out.flush();
      }
      
      public static void main(String[] args) throws Exception { new Main().run(); }
      
      private byte[] inbuf = new byte[1024];
      public int lenbuf = 0, ptrbuf = 0;
      
      private int readByte()
      {
          if(lenbuf == -1)throw new InputMismatchException();
          if(ptrbuf >= lenbuf){
              ptrbuf = 0;
              try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
              if(lenbuf <= 0)return -1;
          }
          return inbuf[ptrbuf++];
      }
      
      private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
      private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
      
      private double nd() { return Double.parseDouble(ns()); }
      private char nc() { return (char)skip(); }
      
      private String ns()
      {
          int b = skip();
          StringBuilder sb = new StringBuilder();
          while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
              sb.appendCodePoint(b);
              b = readByte();
          }
          return sb.toString();
      }
  
      private char[] ns(int n)
      {
          char[] buf = new char[n];
          int b = skip(), p = 0;
          while(p < n && !(isSpaceChar(b))){
              buf[p++] = (char)b;
              b = readByte();
          }
          return n == p ? buf : Arrays.copyOf(buf, p);
      }
   
      private int[] na(int n)
      {
          int[] a = new int[n];
          for(int i = 0;i < n;i++)a[i] = ni();
          return a;
      }
  
      private int[] na2(int n)
      {
          int[] a = new int[n+1];
          a[0] = 0;
          for(int i = 1;i <= n;i++)a[i] = ni();
          return a;
      }
   
      private long[] nal(int n)
      {
          long[] a = new long[n];
          for(int i = 0;i < n;i++)a[i] = nl();
          return a;
      }
   
      private long[] nal2(int n)
      {
          long[] a = new long[n+1];
          a[0] = 0L;
          for(int i = 1;i <= n;i++)a[i] = nl();
          return a;
      }
   
      private char[][] nm(int n, int m) {
          char[][] map = new char[n][];
          for(int i = 0;i < n;i++)map[i] = ns(m);
          return map;
      }
   
      private int[][] nmi(int n, int m) {
          int[][] map = new int[n][];
          for(int i = 0;i < n;i++)map[i] = na(m);
          return map;
      }
   
      private int ni() { return (int)nl(); }
   
      private long nl()
      {
          long num = 0;
          int b;
          boolean minus = false;
          while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
          if(b == '-'){
              minus = true;
              b = readByte();
          }
   
          while(true){
              if(b >= '0' && b <= '9'){
                  num = num * 10 + (b - '0');
              }else{
                  return minus ? -num : num;
              }
              b = readByte();
          }
      }
  
      private int gcd(int a, int b) 
      {
          if(b == 0)
              return a;
          if(a == 0)
              return b;
          return gcd(b, a%b);
      }
  
      private int gcdRange(int l, int r) 
      {
          int ans = 1;
          for (int i = r; i >= 1; i--) {
              if ((r / i) - (l - 1) / i > 1) {
                  ans = i;
                  break;
              }
          }
          return ans;
      }
  
      private void gcdPrefix(int[] a, int n) 
      {
  //  ∑i = gcd(a1,a2,... ,ai) = gcd(a1) + gcd(a1,a2) + gcd(a1,a2,a3) + gcd(a1,a2,a3,a4) + .............;
          int[] f = new int[5000001];
          for(int v : a) f[v]++;
          for(int i = 1;i <= 5000000;i++){
              for(int j = i*2;j <= 5000000;j+=i){
                  f[i] += f[j];
              }
          }
          long[] dp = new long[5000001];
          long ans = 0;
          for(int i = 5000000;i >= 1;i--){
              dp[i] = (long)f[i] * i;
              for(int j = i*2;j <= 5000000;j+=i){
                  dp[i] = Math.max(dp[i], dp[j] + (long)(f[i] - f[j]) * i);
              }
              ans = Math.max(ans, dp[i]);
          }
          out.println(ans);
      }
  
      private int findTrailingZerosInFactorial(int n)
      {
      //  5 -> 1 , 10 -> 2 , 20 -> 4 , 100 -> 24
          if (n < 0)
              return -1;
          int count = 0;
          for (int i = 5; n / i >= 1; i *= 5)
              count += n / i;
   
          return count;
      }
  
      private void LongestX() 
      {
  //  Given is a string S consisting of X and ..
  //  You can do the following operation on S between 0 and K times (inclusive).
  //  Replace a . with an X.
  //  What is the maximum possible number of consecutive Xs in S after the operations?
          char[] s = ns().toCharArray();
          int K = ni();
          int n = s.length;
          int[] cum = new int[n+1];
          cum[0] = 0;
          for(int i = 0;i < n;i++){
              cum[i+1] = cum[i] + (s[i] == '.' ? 1 : 0);
          }
   
          int low = -1;
          int high = s.length + 1;
          outer:
          while(high - low > 1){
              int h = high + low >> 1;
              for(int i = 0;i+h <= n;i++){
                  if(cum[i+h] - cum[i] <= K){
                      low = h;
                      continue outer;
                  }
              }
              high = h;
          }
          out.println(low);
      }
  
      private long calculate_Xor(long n) 
      {
          if(n%4 == 0) return n;
          else if(n%4 == 1) return 1;
          else if(n%4 == 2) return n+1;
          return 0;
      }
  
      private class Pair
      {
          int first;
          int second;
          Pair(int a, int b)
          {
              first = a;
              second = b;
          }
      }
  //  ***********************************************START****************************************************
      void solve()
      {
          int t = ni();
          while(t-->0)
          {
              int x1 = ni();
              int p1 = ni();
              int x2 = ni();
              int p2 = ni();
  
              String first = "" + x1;
              String second = "" + x2;
  
              int lengthfirst = first.length() + p1;
              int lengthsecond = second.length() + p2;
           
              if (lengthfirst > lengthsecond)
              {
                  out.println(">");
              }
              else if (lengthfirst < lengthsecond)
              {
                  out.println("<");
              }
              else
              {
                  if (p1 == p2)
                  {
                      if (x1 > x2)
                          out.println(">");
                      else if (x1 < x2)
                          out.println("<");
                      else 
                          out.println("=");
                  }
                  else
                  {
                      long multiplier = Math.abs(first.length() - second.length());
                      long min = Math.min(x1,x2);
  
                      if (min == x1)
                      x1 *= (long)Math.pow(10, (multiplier));
                      else if (min == x2)
                      x2 *= (long)Math.pow(10, (multiplier));
                      
                      if (x1 > x2)
                          out.println(">");
                      else if (x1 < x2)
                          out.println("<");
                      else
                          out.println("=");
                  }
              }
          }
      }
  //  ***********************************************ENDS*****************************************************
      public static class FastWriter
      {
          private static final int BUF_SIZE = 1<<13;
          private final byte[] buf = new byte[BUF_SIZE];
          private final OutputStream out;
          private int ptr = 0;
   
          private FastWriter(){out = null;}
   
          public FastWriter(OutputStream os)
          {
              this.out = os;
          }
   
          public FastWriter(String path)
          {
              try {
                  this.out = new FileOutputStream(path);
              } catch (FileNotFoundException e) {
                  throw new RuntimeException("FastWriter");
              }
          }
   
          public FastWriter write(byte b)
          {
              buf[ptr++] = b;
              if(ptr == BUF_SIZE)innerflush();
              return this;
          }
   
          public FastWriter write(char c)
          {
              return write((byte)c);
          }
   
          public FastWriter write(char[] s)
          {
              for(char c : s){
                  buf[ptr++] = (byte)c;
                  if(ptr == BUF_SIZE)innerflush();
              }
              return this;
          }
   
          public FastWriter write(String s)
          {
              s.chars().forEach(c -> {
                  buf[ptr++] = (byte)c;
                  if(ptr == BUF_SIZE)innerflush();
              });
              return this;
          }
   
          private static int countDigits(int l) {
              if (l >= 1000000000) return 10;
              if (l >= 100000000) return 9;
              if (l >= 10000000) return 8;
              if (l >= 1000000) return 7;
              if (l >= 100000) return 6;
              if (l >= 10000) return 5;
              if (l >= 1000) return 4;
              if (l >= 100) return 3;
              if (l >= 10) return 2;
              return 1;
          }
   
          public FastWriter write(int x)
          {
              if(x == Integer.MIN_VALUE){
                  return write((long)x);
              }
              if(ptr + 12 >= BUF_SIZE)innerflush();
              if(x < 0){
                  write((byte)'-');
                  x = -x;
              }
              int d = countDigits(x);
              for(int i = ptr + d - 1;i >= ptr;i--){
                  buf[i] = (byte)('0'+x%10);
                  x /= 10;
              }
              ptr += d;
              return this;
          }
   
          private static int countDigits(long l) {
              if (l >= 1000000000000000000L) return 19;
              if (l >= 100000000000000000L) return 18;
              if (l >= 10000000000000000L) return 17;
              if (l >= 1000000000000000L) return 16;
              if (l >= 100000000000000L) return 15;
              if (l >= 10000000000000L) return 14;
              if (l >= 1000000000000L) return 13;
              if (l >= 100000000000L) return 12;
              if (l >= 10000000000L) return 11;
              if (l >= 1000000000L) return 10;
              if (l >= 100000000L) return 9;
              if (l >= 10000000L) return 8;
              if (l >= 1000000L) return 7;
              if (l >= 100000L) return 6;
              if (l >= 10000L) return 5;
              if (l >= 1000L) return 4;
              if (l >= 100L) return 3;
              if (l >= 10L) return 2;
              return 1;
          }
   
          public FastWriter write(long x)
          {
              if(x == Long.MIN_VALUE){
                  return write("" + x);
              }
              if(ptr + 21 >= BUF_SIZE)innerflush();
              if(x < 0){
                  write((byte)'-');
                  x = -x;
              }
              int d = countDigits(x);
              for(int i = ptr + d - 1;i >= ptr;i--){
                  buf[i] = (byte)('0'+x%10);
                  x /= 10;
              }
              ptr += d;
              return this;
          }
   
          public FastWriter write(double x, int precision)
          {
              if(x < 0){
                  write('-');
                  x = -x;
              }
              x += Math.pow(10, -precision)/2;
              //      if(x < 0){ x = 0; }
              write((long)x).write(".");
              x -= (long)x;
              for(int i = 0;i < precision;i++){
                  x *= 10;
                  write((char)('0'+(int)x));
                  x -= (int)x;
              }
              return this;
          }
   
          public FastWriter writeln(char c){
              return write(c).writeln();
          }
   
          public FastWriter writeln(int x){
              return write(x).writeln();
          }
   
          public FastWriter writeln(long x){
              return write(x).writeln();
          }
   
          public FastWriter writeln(double x, int precision){
              return write(x, precision).writeln();
          }
   
          public FastWriter write(int... xs)
          {
              boolean first = true;
              for(int x : xs) {
                  if (!first) write(' ');
                  first = false;
                  write(x);
              }
              return this;
          }
   
          public FastWriter write(long... xs)
          {
              boolean first = true;
              for(long x : xs) {
                  if (!first) write(' ');
                  first = false;
                  write(x);
              }
              return this;
          }
   
          public FastWriter writeln()
          {
              return write((byte)'\n');
          }
   
          public FastWriter writeln(int... xs)
          {
              return write(xs).writeln();
          }
   
          public FastWriter writeln(long... xs)
          {
              return write(xs).writeln();
          }
   
          public FastWriter writeln(char[] line)
          {
              return write(line).writeln();
          }
   
          public FastWriter writeln(char[]... map)
          {
              for(char[] line : map)write(line).writeln();
              return this;
          }
   
          public FastWriter writeln(String s)
          {
              return write(s).writeln();
          }
   
          private void innerflush()
          {
              try {
                  out.write(buf, 0, ptr);
                  ptr = 0;
              } catch (IOException e) {
                  throw new RuntimeException("innerflush");
              }
          }
   
          public void flush()
          {
              innerflush();
              try {
                  out.flush();
              } catch (IOException e) {
                  throw new RuntimeException("flush");
              }
          }
   
          public FastWriter print(byte b) { return write(b); }
          public FastWriter print(char c) { return write(c); }
          public FastWriter print(char[] s) { return write(s); }
          public FastWriter print(String s) { return write(s); }
          public FastWriter print(int x) { return write(x); }
          public FastWriter print(long x) { return write(x); }
          public FastWriter print(double x, int precision) { return write(x, precision); }
          public FastWriter println(char c){ return writeln(c); }
          public FastWriter println(int x){ return writeln(x); }
          public FastWriter println(long x){ return writeln(x); }
          public FastWriter println(double x, int precision){ return writeln(x, precision); }
          public FastWriter print(int... xs) { return write(xs); }
          public FastWriter print(long... xs) { return write(xs); }
          public FastWriter println(int... xs) { return writeln(xs); }
          public FastWriter println(long... xs) { return writeln(xs); }
          public FastWriter println(char[] line) { return writeln(line); }
          public FastWriter println(char[]... map) { return writeln(map); }
          public FastWriter println(String s) { return writeln(s); }
          public FastWriter println() { return writeln(); }
      }
   
      public void trnz(int... o)
      {
          for(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+":"+o[i]+" ");
          System.out.println();
      }
   
      // print ids which are 1
      public void trt(long... o)
      {
          Queue<Integer> stands = new ArrayDeque<>();
          for(int i = 0;i < o.length;i++){
              for(long x = o[i];x != 0;x &= x-1)stands.add(i<<6|Long.numberOfTrailingZeros(x));
          }
          System.out.println(stands);
      }
   
      public void tf(boolean... r)
      {
          for(boolean x : r)System.out.print(x?'#':'.');
          System.out.println();
      }
   
      public void tf(boolean[]... b)
      {
          for(boolean[] r : b) {
              for(boolean x : r)System.out.print(x?'#':'.');
              System.out.println();
          }
          System.out.println();
      }
   
      public void tf(long[]... b)
      {
          if(INPUT.length() != 0) {
              for (long[] r : b) {
                  for (long x : r) {
                      for (int i = 0; i < 64; i++) {
                          System.out.print(x << ~i < 0 ? '#' : '.');
                      }
                  }
                  System.out.println();
              }
              System.out.println();
          }
      }
   
      public void tf(long... b)
      {
          if(INPUT.length() != 0) {
              for (long x : b) {
                  for (int i = 0; i < 64; i++) {
                      System.out.print(x << ~i < 0 ? '#' : '.');
                  }
              }
              System.out.println();
          }
      }
  
      private boolean oj = System.getProperty("ONLINE_JUDGE") != null;
      private void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }
  }