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 os
  import sys
  from bisect import bisect, bisect_left, insort, insort_left
  from heapq import heapify, heappop, heappush, nlargest, nsmallest
  from io import BytesIO, IOBase
  from types import GeneratorType
  
  # Fast IO for Python
  
  BUFSIZE: int = 8192
  
  
  class FastIO(IOBase):
      newlines = 0
  
      def __init__(self, file):
          self._fd = file.fileno()
          self.buffer = BytesIO()
          self.writable = "x" in file.mode or "r" not in file.mode
          self.write = self.buffer.write if self.writable else None
  
      def read(self):
          while True:
              b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
              if not b:
                  break
              ptr = self.buffer.tell()
              self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
          self.newlines = 0
          return self.buffer.read()
  
      def readline(self):
          while self.newlines == 0:
              b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
              self.newlines = b.count(b"\n") + (not b)
              ptr = self.buffer.tell()
              self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
          self.newlines -= 1
          return self.buffer.readline()
  
      def flush(self):
          if self.writable:
              os.write(self._fd, self.buffer.getvalue())
              self.buffer.truncate(0), self.buffer.seek(0)
  
  
  class IOWrapper(IOBase):
      def __init__(self, file):
          self.buffer = FastIO(file)
          self.flush = self.buffer.flush
          self.writable = self.buffer.writable
          self.write = lambda s: self.buffer.write(s.encode("ascii"))
          self.read = lambda: self.buffer.read().decode("ascii")
          self.readline = lambda: self.buffer.readline().decode("ascii")
  
  
  def print(*args, **kwargs):
      """Prints the values to a stream, or to sys.stdout by default."""
      sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
      at_start = True
      for x in args:
          if not at_start:
              file.write(sep)
          file.write(str(x))
          at_start = False
      file.write(kwargs.pop("end", "\n"))
      if kwargs.pop("flush", False):
          file.flush()
  
  
  sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
  def input(): return sys.stdin.readline().rstrip("\r\n")
  
  
  # Bootstrap used for recursion, use yield instead of return
  
  def bootstrap(f, stack=[]):
      def wrappedfunc(*args, **kwargs):
          if stack:
              return f(*args, **kwargs)
          else:
              to = f(*args, **kwargs)
              while True:
                  if type(to) is GeneratorType:
                      stack.append(to)
                      to = next(to)
                  else:
                      stack.pop()
                      if not stack:
                          break
                      to = stack[-1].send(to)
              return to
      return wrappedfunc
  
  
  # Never use += for string concatenation
  # Always use .join for string concatenation
  # Use PyPy3 for Codeforces
  # Use Python3 for Codechef
  
  # Function to compute inverse of a under modulo m
  
  def modInverse(a, m):
  
      g = gcd(a, m)
  
      if (g != 1):
          return -1
  
      else:
          # If a and m are relatively prime,
          # then modulo inverse is a^(m-2) mode m
          return power(a, m - 2, m)
  
  
  # Function to compute x^y under modulo m
  
  def power(x, y, m):
  
      if (y == 0):
          return 1
  
      p = power(x, y // 2, m) % m
      p = (p * p) % m
  
      if(y % 2 == 0):
          return p
      else:
          return ((x * p) % m)
  
  
  # Function to return gcd of a and b
  
  def gcd(a, b):
      if (a == 0):
          return b
  
      return gcd(b % a, a)
  
  
  # Sieve of Eratosthenes to get prime upto n
  
  def SieveOfEratosthenes(n):
      prime = [True for i in range(n+1)]
      p = 2
      while (p * p <= n):
  
          # If prime[p] is not
          # changed, then it is a prime
          if (prime[p] == True):
  
              # Update all multiples of p
              for i in range(p * p, n+1, p):
                  prime[i] = False
          p += 1
  
      ans = set()
      for p in range(2, n+1):
          if prime[p]:
              ans.add(p)
  
      return ans
  
  
  MOD = 1000000007
  
  
  # Main function
  
  def main():
      t = int(input())
      for i in range(t):
          temp = list(map(int, input().split()))
          x1, p1 = temp[0], temp[1]
          temp = list(map(int, input().split()))
          x2, p2 = temp[0], temp[1]
  
          if x1 == x2 and p1 == p2:
              print('=')
          elif x1 > x2 and p1 > p2:
              print('>')
          elif x1 < x2 and p1 < p2:
              print('<')
          elif x1 == x2 and p1 > p2:
              print('>')
          elif x1 == x2 and p1 < p2:
              print('<')
          elif x1 > x2 and p1 == p2:
              print('>')
          elif x1 < x2 and p1 == p2:
              print('<')
          elif x1 > x2 and p1 < p2:
              zerosNeeded = len(str(x1))-len(str(x2))
              p2 = p2-zerosNeeded
              x2 = int(str(x2)+("0"*zerosNeeded))
              if x1 == x2:
                  if p1 > p2:
                      print('>')
                  elif p1 < p2:
                      print('<')
                  else:
                      print('=')
              elif x1 < x2:
                  if p1 > p2:
                      print('>')
                  elif p1 < p2:
                      print('<')
                  else:
                      print('<')
              else:
                  if p1 > p2:
                      print('>')
                  elif p1 < p2:
                      print('<')
                  else:
                      print('>')
  
          elif x1 < x2 and p1 > p2:
              zerosNeeded = len(str(x2))-len(str(x1))
              p1 = p1-zerosNeeded
              x1 = int(str(x1)+("0"*zerosNeeded))
              if x1 == x2:
                  if p1 > p2:
                      print('>')
                  elif p1 < p2:
                      print('<')
                  else:
                      print('=')
              elif x1 < x2:
                  if p1 > p2:
                      print('>')
                  elif p1 < p2:
                      print('<')
                  else:
                      print('<')
              else:
                  if p1 > p2:
                      print('>')
                  elif p1 < p2:
                      print('<')
                  else:
                      print('>')
  
  
  main()
  