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.HashMap;
  import java.util.StringTokenizer;
  
  public class abc {
      static HashMap<Integer, Integer> hm = new HashMap<Integer, Integer>();
      static int cost[];
      static PrintWriter pw = new PrintWriter(System.out);
      static Snner sc = new Snner(System.in);
      Integer memo[];
  
      public static void main(String ar[]) throws IOException {
          //   memo=new Integer[];
  
        /*  int n = sc.nextInt();
          int k = sc.nextInt();
  //        if (k <= n) k = n - k + 1;
  
          cost = new int[n + 1];
          for (int i = 0; i < n; i++) cost[i + 1] = sc.nextInt();
          pw.println(dp(n, k));
  */
          // pw.println("1".compareTo("4"));
          int t = sc.nextInt();
          while (t-- > 0) {
              double aa = sc.nextInt();
              long p1 = sc.nextInt();
              double bb = sc.nextInt();
              long p2 = sc.nextInt();
              while (aa >= 10) {aa /= 10;p1++;}
              while (bb>= 10) {bb/= 10;p2++;}
              if (p1 < p2) pw.println("<");
              else if (p1 > p2) pw.println(">");
              else  {
                  if (aa > bb) pw.println(">");
                  else if (aa < bb) pw.println("<");
                  else pw.println("=");
              }
  /*
              double a = (Math.log10(sc.nextLong()) + (double) sc.nextInt());
              double b = (Math.log10(sc.nextLong()) + (double) sc.nextInt());
              double res = Double.compare(a, b);
              if (res > 0) pw.println(">");
              else if (res < 0) pw.println("<");
              else pw.println("=");
  */
          }
          pw.close();
      }
  
      static void xena_and_ringroad() throws IOException {
          int n = sc.nextInt();
          int m = sc.nextInt();
          int a;
          int cur = 1;
          int k = 0;
          for (int i = 0; i < m; i++) {
              a = sc.nextInt();
              if (a >= cur) k += a - cur;
              else k += n - cur + a;
              cur = a;
          }
          pw.println(k);
      }
  
      static int dp(int x, int k) {
          if (x <= 1) return 0;
          if (hm.containsKey(x)) return hm.get(x);
          // if(memo[x]!=null)return memo[x];
          int ret = 0;
          if (x == 2) ret = dp(x - 1, k) + Math.abs((cost[x] - cost[x - 1]));
          else
              ret = Math.min(dp(x - 1, k) + Math.abs((cost[x] - cost[x - 1])), Math.abs(cost[x] - cost[x - 2]) + dp(x - 2, k));
          if (x > k) ret = Math.min(ret, dp(x - k, k) + cost[x] - cost[x - k]);
          hm.put(x, ret);
          /// memo[x]=ret;
          return ret;
      }
  }
  
  class Snner {
      StringTokenizer st;
      BufferedReader br;
  
      public Snner(InputStream s) {
          br = new BufferedReader(new InputStreamReader(s));
      }
  
      public Snner(FileReader r) {
          br = new BufferedReader(r);
      }
  
  
      public String next() throws IOException {
          while (st == null || !st.hasMoreTokens())
              st = new StringTokenizer(br.readLine());
          return st.nextToken();
      }
  
      public int nextInt() throws IOException {
          return Integer.parseInt(next());
      }
  
      public long nextLong() throws IOException {
          return Long.parseLong(next());
      }
  
      public String nextLine() throws IOException {
          return br.readLine();
      }
  
      public double nextDouble() throws IOException {
          String x = next();
          StringBuilder sb = new StringBuilder("0");
          double res = 0, f = 1;
          boolean dec = false, neg = false;
          int start = 0;
          if (x.charAt(0) == '-') {
              neg = true;
              start++;
          }
          for (int i = start; i < x.length(); i++)
              if (x.charAt(i) == '.') {
                  res = Long.parseLong(sb.toString());
                  sb = new StringBuilder("0");
                  dec = true;
              } else {
                  sb.append(x.charAt(i));
                  if (dec)
                      f *= 10;
              }
          res += Long.parseLong(sb.toString()) / f;
          return res * (neg ? -1 : 1);
      }
  
      public long[] nextlongArray(int n) throws IOException {
          long[] a = new long[n];
          for (int i = 0; i < n; i++)
              a[i] = nextLong();
          return a;
      }
  
      public Long[] nextLongArray(int n) throws IOException {
          Long[] a = new Long[n];
          for (int i = 0; i < n; i++)
              a[i] = nextLong();
          return a;
      }
  
      public int[] nextIntArray(int n) throws IOException {
          int[] a = new int[n];
          for (int i = 0; i < n; i++)
              a[i] = nextInt();
          return a;
      }
  
      public Integer[] nextIntegerArray(int n) throws IOException {
          Integer[] a = new Integer[n];
          for (int i = 0; i < n; i++)
              a[i] = nextInt();
          return a;
      }
  
      public boolean ready() throws IOException {
          return br.ready();
      }
  
  }
  
  