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 faltu;
  import java.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  //import java.security.KeyStore.Entry;
  import java.util.*;
  import java.util.Map.Entry;
  
  public class Main {
      static long LowerBound(long[] a2, long x) { // x is the target value or key
  	  int l=-1,r=a2.length;
  	  while(l+1<r) {
  	    int m=(l+r)>>>1;
  	    if(a2[m]>=x) r=m;
  	    else l=m;
  	  }
  	  return r;
  	}
      static int UpperBound(int a[], int x) {// x is the key or target value
  	    int l=-1,r=a.length;
  	    while(l+1<r) {
  	       int m=(l+r)>>>1;
  	       if(a[m]<=x) l=m;
  	       else r=m;
  	    }
  	    return l+1;
      }
      public static long getClosest(long val1, long val2,long target)
  	{
  		if (target - val1 >= val2 - target)
  		return val2;       
  		else
  		return val1;       
  	}
      public static long findClosest(long arr[], long target)
      {
          int n = arr.length;
   
          // Corner cases
          if (target <= arr[0])
              return arr[0];
          if (target >= arr[n - 1])
              return arr[n - 1];
   
          // Doing binary search
          int i = 0, j = n, mid = 0;
          while (i < j) {
              mid = (i + j) / 2;
   
              if (arr[mid] == target)
                  return arr[mid];
   
              /* If target is less than array element,
                 then search in left */
              if (target < arr[mid]) {
          
                  // If target is greater than previous
                  // to mid, return closest of two
                  if (mid > 0 && target > arr[mid - 1])
                      return getClosest(arr[mid - 1],
                                    arr[mid], target);
                   
                  /* Repeat for left half */
                  j = mid;             
              }
   
              // If target is greater than mid
              else {
                  if (mid < n-1 && target < arr[mid + 1])
                      return getClosest(arr[mid],
                            arr[mid + 1], target);               
                  i = mid + 1; // update i
              }
          }
   
          // Only single element left after search
          return arr[mid];
      }
      static void ruffleSort(long[] a) {
  		int n=a.length;
  		Random r=new Random();
  		for (int i=0; i<a.length; i++) {
  			long oi=r.nextInt(n), temp=a[i];
  			a[i]=a[(int)oi];
  			a[(int)oi]=temp;
  		}
  		Arrays.sort(a);
  	}
      static void ruffleSort(int[] a) {
  		int n=a.length;
  		Random r=new Random();
  		for (int i=0; i<a.length; i++) {
  			int oi=r.nextInt(n), temp=a[i];
  			a[i]=a[oi];
  			a[oi]=temp;
  		}
  		Arrays.sort(a);
  	}
      private int ceilIndex(int input[], int T[], int end, int s){
          int start = 0;
          int middle;
          int len = end;
          while(start <= end){
              middle = (start + end)/2;
              if(middle < len && input[T[middle]] < s && s <= input[T[middle+1]]){
                  return middle+1;
              }else if(input[T[middle]] < s){
                  start = middle+1;
              }else{
                  end = middle-1;
              }
          }
          return -1;
      }
      public static int findIndex(long arr[], long t) 
      { 
   
          // if array is Null 
          if (arr == null) { 
              return -1; 
          } 
   
          // find length of array 
          int len = arr.length; 
          int i = 0; 
   
          // traverse in the array 
          while (i < len) {
              if (arr[i] == t) { 
                  return i; 
              } 
              else { 
                  i = i + 1; 
              } 
          } 
          return -1; 
      }
   
      static long gcd(long a, long b)
      {
          if (a == 0)
              return b; 
          return gcd(b % a, a); 
      }
      static int gcd(int a, int b)
      {
          if (a == 0)
              return b; 
          return gcd(b % a, a); 
      }
      static long lcm(long a, long b)
      {
          return (a / gcd(a, b)) * b;
      }
   
      public static int[] swap(int a[], int left, int right)
      {
          int temp = a[left];
          a[left] = a[right];
          a[right] = temp;
          return a;
      }
      public static void swap(int max0,int max1)
      {
      	int temp=max0;
      	max0=max1;
      	max1=temp;
      }
   
      public static int[] reverse(int a[], int left, int right)
      {
   
          // Reverse the sub-array
          while (left < right) {
              int temp = a[left];
              a[left++] = a[right];
              a[right--] = temp;
          }
          return a;
      }
   
    
      static class FastReader {
          BufferedReader br;
          StringTokenizer st;
   
          public FastReader()
          {
              br = new BufferedReader(
                  new InputStreamReader(System.in));
          }
   
          String next()
          {
              while (st == null || !st.hasMoreElements()) {
                  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;
          }
      }
      
  //    *******----segement tree implement---******
      
  //    -------------START--------------------------
      
      void buildTree (int[] arr,int[] tree,int start,int end,int treeNode)
      {
      	if(start==end)
      	{
      		tree[treeNode]=arr[start];
      		return;
      	}
      	buildTree(arr,tree,start,end,2*treeNode);
      	buildTree(arr,tree,start,end,2*treeNode+1);
      	tree[treeNode]=tree[treeNode*2]+tree[2*treeNode+1];
      }
      void updateTree(int[] arr,int[] tree,int start,int end,int treeNode,int idx,int value)
      {
      	if(start==end)
      	{
      		arr[idx]=value;
      		tree[treeNode]=value;
      		return;
      	}
      	int mid=(start+end)/2;
      	if(idx>mid)
      	{
      		updateTree(arr,tree,mid+1,end,2*treeNode+1,idx,value);
      	}
      	else
      	{
      		updateTree(arr,tree,start,mid,2*treeNode,idx,value);
      	}
      	tree[treeNode]=tree[2*treeNode]+tree[2*treeNode+1];
      }
      	static int[][] dp;
      	private static long getClosetNumberOfTarget(long[] dataArray, long target) {
      		 
      		// Edge case - Check if array length is zero
      		if (dataArray.length == 0)
      			System.exit(1);
      		// Straight case - If target is smaller or equal to first element in array
      		if (target <= dataArray[0])
      			return dataArray[0];
      		// Straight case - If target is greater or equal to last element in array
      		if (target >= dataArray[dataArray.length - 1])
      			return dataArray[dataArray.length - 1];
       
      		// Start binary search algorithm
      		int start = 0;
      		int end = dataArray.length-1;
      		int mid = 0;
       
      		// Keep dividing array till further division is not possible
      		while (end - start != 1) {
      			// Calculate middle index
      			mid = (start + end) / 2;
      			// Check if middle element is equal to target
      			if (target == dataArray[mid])
      				// If yes return middle element as middle element = target 
      				return dataArray[mid];
      			// Check if target is smaller to middle element. If yes, take first half of array including mid
      			if (target < dataArray[mid]) 
      				end = mid;
      			// Check if target is greater to middle element. If yes, take first half of array including mid
      			if (target > dataArray[mid])
      				start = mid;	
      		}
      		// Now you will have only two numbers in array in which target number will fall
      		return Math.abs(target - dataArray[start]) <= Math.abs(target - dataArray[end]) ? dataArray[start]
      				: dataArray[end];
      	}
      	private static int getClosetNumberOfTarget(int[] dataArray, int target) {
      		 
      		// Edge case - Check if array length is zero
      		if (dataArray.length == 0)
      			System.exit(1);
      		// Straight case - If target is smaller or equal to first element in array
      		if (target <= dataArray[0])
      			return dataArray[0];
      		// Straight case - If target is greater or equal to last element in array
      		if (target >= dataArray[dataArray.length - 1])
      			return dataArray[dataArray.length - 1];
       
      		// Start binary search algorithm
      		int start = 0;
      		int end = dataArray.length - 1;
      		int mid = 0;
       
      		// Keep dividing array till further division is not possible
      		while (start < end) {
      			// Calculate middle index
      			mid = (start + end) / 2;
      			// Check if middle element is equal to target
      			if (target == dataArray[mid])
      				// If yes return middle element as middle element = target
      				return dataArray[mid];
      			// Check if target is smaller to middle element. If yes, take first half of
      			// array including mid
      			if (target < dataArray[mid]) {
      				// If target is greater than previous element of middle element, we have reached the deciding range
      				if (target > dataArray[mid - 1])
      					return Math.abs(target - dataArray[mid]) >= Math.abs(target - dataArray[mid - 1]) ? dataArray[mid-1]
      							: dataArray[mid];
      				end = mid - 1;
      			}
      			// Check if target is greater to middle element. If yes, take first half of
      			// array including mid
      			if (target > dataArray[mid]) {
      				// If target is smaller than next element of middle element, we have reached the deciding range
      				if (target < dataArray[mid + 1])
      					return Math.abs(target - dataArray[mid]) <= Math.abs(target - dataArray[mid + 1]) ? dataArray[mid]
      							: dataArray[mid + 1];
       
      				start = mid + 1;
      			}
      		}
      		// after exiting form loop, middle element will be closer
      		return dataArray[mid];
      	}
      	
  //    	disjoint set implementation --start
          static void makeSet(int n)
          {
          	parent=new int[n];
          	rank=new int[n];
          	for(int i=0;i<n;i++)
          	{
          		parent[i]=i;
          		rank[i]=0;
          	}
          	
          }
          static void union(int u,int v)
          {
          	u=findpar(u);
          	v=findpar(v);
          	if(rank[u]<rank[v])parent[u]=v;
          	else if(rank[v]<rank[u])parent[v]=u;
          	else 
          	{
  //        		System.out.println(v+" "+parent[v]);
          		parent[v]=u;
  //        		System.out.println(v+" "+parent[v]);
          		rank[u]++;
          	}
          }
          
      	private static int findpar(int node)
      	{	
      		if(node==parent[node])return node;
      		return parent[node]=findpar(parent[node]);
      	}
      	static int parent[];
          static int rank[];
      	
  //    	*************end
          static Long MOD=(long) (1e9+7);
      	private static int lps(int m ,int n,String s1,String s2,int[][]mat)
          {
              for(int i=1;i<=m;i++)
              {
                  for(int j=1;j<=n;j++)
                  {
                      if(s1.charAt(i-1)==s2.charAt(j-1))mat[i][j]=1+mat[i-1][j-1];
                      else mat[i][j]=Math.max(mat[i-1][j],mat[i][j-1]);
                  }
              }
              return mat[m][n];
          }
      	static long power1(long a,long b) {
      	    if(b == 0){
      	        return 1;
      	    }
      	    long ans = power(a,b/2);
      	    ans *= ans;
      	    if(b % 2!=0){
      	        ans *= a;
      	    }
      	    return ans;
      	}
          public static void main(String[] args)
          {
          	FastReader s = new FastReader();
  	        dp=new int[1001][1001];
  	        long tt = s.nextLong();
  	        while (tt-->0)
  	        {
  	        	int n1=s.nextInt();
  	        	int p1=s.nextInt();
  	        	int n2=s.nextInt();
  	        	int p2=s.nextInt();
  	        	mark(n1,n2,p1,p2);
  	        	
  	        }
  	        	
  	        
          }
      	public static void mark(int xa,int xb,int pa,int pb){
      	    while (Integer.toString(xa).length() < Integer.toString(xb).length()) {
                  xa *= 10;
                  pa--;
              }
              while (Integer.toString(xb).length() < Integer.toString(xa).length()) {
                  xb *= 10;
                  pb--;
              }
              if (pa > pb)
                  System.out.println(">");
              else if (pa< pb)
                   System.out.println("<");
              else {
                  if (xa < xb)
                       System.out.println("<");
                  else if (xa > xb)
                       System.out.println(">");
                  else
                       System.out.println("=");
              }
      	    
      	}
  
          static String lcs(String X, String Y, int m, int n)
          {
              int[][] L = new int[m+1][n+1];
         
              // Following steps build L[m+1][n+1] in bottom up fashion. Note
              // that L[i][j] contains length of LCS of X[0..i-1] and Y[0..j-1] 
              for (int i=0; i<=m; i++)
              {
                  for (int j=0; j<=n; j++)
                  {
                      if (i == 0 || j == 0)
                          L[i][j] = 0;
                      else if (X.charAt(i-1) == Y.charAt(j-1))
                          L[i][j] = L[i-1][j-1] + 1;
                      else
                          L[i][j] = Math.max(L[i-1][j], L[i][j-1]);
                  }
              }
         
              // Following code is used to print LCS
              int index = L[m][n];
              int temp = index;
         
              // Create a character array to store the lcs string
              char[] lcs = new char[index+1];
              lcs[index] = '\u0000'; // Set the terminating character
         
              // Start from the right-most-bottom-most corner and
              // one by one store characters in lcs[]
              int i = m;
              int j = n;
              while (i > 0 && j > 0)
              {
                  // If current character in X[] and Y are same, then
                  // current character is part of LCS
                  if (X.charAt(i-1) == Y.charAt(j-1))
                  {
                      // Put current character in result
                      lcs[index-1] = X.charAt(i-1); 
                        
                      // reduce values of i, j and index
                      i--; 
                      j--; 
                      index--;     
                  }
         
                  // If not same, then find the larger of two and
                  // go in the direction of larger value
                  else if (L[i-1][j] > L[i][j-1])
                      i--;
                  else
                      j--;
              }
              return String.valueOf(lcs);
              // Print the lcs
  //            System.out.print("LCS of "+X+" and "+Y+" is ");
  //            for(int k=0;k<=temp;k++)
  //                System.out.print(lcs[k]);
          }
          static long lis(long[] aa2, int n)
          {
              long lis[] = new long[n];
              int i, j;
              long max = 0;
              for (i = 0; i < n; i++)
                  lis[i] = 1;
              for (i = 1; i < n; i++)
                  for (j = 0; j < i; j++)
                      if (aa2[i] >= aa2[j] && lis[i] <= lis[j] + 1)
                          lis[i] = lis[j] + 1;
              for (i = 0; i < n; i++)
                  if (max < lis[i])
                      max = lis[i];
       
              return max;
          }
          static boolean isPalindrome(String str)
          {
              int i = 0, j = str.length() - 1;
              while (i < j) {
                  if (str.charAt(i) != str.charAt(j))
                      return false;
                  i++;
                  j--;
              }
              return true;
          }
          static boolean issafe(int i, int j, int r,int c, char ch)
          {
  			if (i < 0 || j < 0 || i >= r || j >= c|| ch!= '1')return false;
  			else return true;
          }
          static long power(long a, long b)
          {
          	   a %=MOD;
          	    long out = 1;
          	    while (b > 0) {
          	        if((b&1)!=0)out = out * a % MOD;
          	        a = a * a % MOD;
          	        b >>= 1;
          			a*=a;
          	    }
          	    return out;
          }
  //        static long power(long x, long y)
  //        {
  //            long res = 1;     // Initialize result
  //          
  //            while (y > 0)
  //            {
  //               
  //                // If y is odd, multiply x with result
  //                if ((y & 1) != 0)
  //                    res = res * x;
  //          
  //                // y must be even now
  //                y = y >> 1; // y = y/2
  //                x = x * x;  // Change x to x^2
  //            }
  //            return res;
  //        }
  }
  class pair{
  	long x,y;
  	public pair(long x,long y)
  	{
  		this.x=x;
  		this.y=y;
  	}
  }
  
  
  
  