A. Compare T-Shirt Sizes

Problem - A - Codeforces

Two T-shirt sizes are given: aa and bb. The T-shirt size is either a string M or a string consisting of several (possibly zero) characters X and one of the characters S or L.

For example, strings M, XXL, S, XXXXXXXS could be the size of some T-shirts. And the strings XM, LL, SX are not sizes.

The letter M stands for medium, S for small, L for large. The letter X refers to the degree of size (from eXtra). For example, XXL is extra-extra-large (bigger than XL, and smaller than XXXL).

You need to compare two given sizes of T-shirts aa and bb.

The T-shirts are compared as follows:

• any small size (no matter how many letters X) is smaller than the medium size and any large size;
• any large size (regardless of the number of letters X) is larger than the medium size and any small size;
• the more letters X before S, the smaller the size;
• the more letters X in front of L, the larger the size.

For example:

• XXXS < XS
• XXXL > XL
• XL > M
• XXL = XXL
• XXXXXS < M
• XL > XXXS

Input

The first line of the input contains a single integer tt (1≤t≤1041≤t≤104) — the number of test cases.

Each test case consists of one line, in which aa and bb T-shirt sizes are written. The lengths of the strings corresponding to the T-shirt sizes do not exceed 5050. It is guaranteed that all sizes are correct.

Output

For each test case, print on a separate line the result of comparing aa and bb T-shirt sizes (lines "<", ">" or "=" without quotes).

Example

input

Copy

6

XXXS XS

XXXL XL

XL M

XXL XXL

XXXXXS M

L M

output

Copy

<
>
>
=
<
>

#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<deque>
#include<cmath>
#include<string.h>
using namespace std;
// ctrl+shift+C 注释
//ctrl+shift+x 取消
#define int long long
#define YES cout<<"YES"<<endl;
#define NO cout<<"NO"<<endl;
#define fast ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef pair<int,int> PII;
const int N=2e5+10;
const ll M=1e18+10;
const int mod=1e9+7;
int aa[N],sum[N];
priority_queue<int,vector<int>,greater<int> >pq;
set<int>se;
map<string,int>mp;
queue<int>qu;
vector<int>v;
deque<int>de;
string a,b;
void solve()
{
    cin>>a>>b;
    int la=0,lb=0;
    if(a=="M")la=1;
    if(a[a.size()-1]=='L')la=2;
     if(b=="M")lb=1;
    if(b[b.size()-1]=='L')lb=2;
  if(a[a.size()-1]=='L')
  {
      for(int i=0;a[i];i++)
      {
          if(a[i]=='X')
          {
              la++;
          }
      }
  }
  else  if(a[a.size()-1]=='S')
  {
     for(int i=0;a[i];i++)
      {
          if(a[i]=='X')
          {
              la--;
          }
      }
  }
   if(b[b.size()-1]=='L')
  {
      for(int i=0;b[i];i++)
      {
          if(b[i]=='X')
          {
              lb++;
          }
      }
  }
 else  if(b[b.size()-1]=='S')
  {
     for(int i=0;b[i];i++)
      {
          if(b[i]=='X')
          {
              lb--;
          }
      }
  }
  if(la>lb)cout<<">"<<endl;
  else if(la<lb)cout<<"<"<<endl;
  else cout<<"="<<endl;
}
signed main()
{
   int t=1;
   cin>>t;
   while(t--)
   {
       solve();
   }
}