A_Long_Comparison.cpp

#include <bits/stdc++.h>
using namespace std;

// Macros and constants
#define pb push_back
#define endl ("\n")
#define pi (3.141592653589)
#define int long long
#define float double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(c) c.begin(), c.end()
#define mini(a, b, c) min(c, min(a, b))
#define mini2(a, b, c, d) min(d, min(c, min(a, b)))
#define rrep(i, s, n) for (int i = n - 1; i >= s; i--)
#define rep(i, n) for (int i = 0; i < n; i++)
#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#define scin(str) getline(cin, str)

// Debugging Macros
#define debug(x) cerr << #x << " = " << x << endl
#define debug2(x, y) cerr << #x << " = " << x << ", " << #y << " = " << y << endl

// Aliases and Types
using vec = vector<int>;
using pii = pair<int, int>;
using mapi = map<int, int>;
using si = set<int>;

const int mod = 1e9 + 7;

// Global Constants
const int dx[4]{1, 0, -1, 0}, dy[4]{0, 1, 0, -1}; // for every grid problem!!
const int N = 2e5 + 5;


void solve()
{
    int x1, p1, x2, p2;
    cin >> x1 >> p1 >> x2 >> p2;
    int y = min(p1, p2);
    p1 -= y, p2 -= y;
    p1 = min(p1, 8LL);
    p2 = min(p2, 8LL);
    for (int i = 1; i <= p1; i++)
    {
        x1 *= 10;
    }
    for (int i = 1; i <= p2; i++)
    {
        x2 *= 10;
    }
    if (x1 == x2)
    {
        cout << "=\n";
    }
    else if (x1 > x2)
    {
        cout << ">\n";
    }
    else
    {
        cout << "<\n";
    }

    return;
}

int32_t main()
{
    fast

    int t;
    cin >> t;
    while (t--)
    {
        solve();
    }
}