CP Template

#include <math.h>

#include <algorithm>
#include <climits>
#include <iostream>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

/* clang-format off */

/* TYPES  */
using ll = long long int;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
using vi = vector<int>;
using vll = vector<long long>;
using mii = map<int, int>;
using si = set<int>;
using sc = set<char>;
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*(b/gcd(a,b)))

/* FUNCTIONS */
#define f(i,s,e) for(long long int i=s;i<e;i++)
#define cf(i,s,e) for(long long int i=s;i<=e;i++)
#define rf(i,e,s) for(long long int i=e-1;i>=s;i--)
#define pb push_back
#define eb emplace_back

/* UTILS */
#define MOD 1000000007
#define PI 3.1415926535897932384626433832795
ll min(ll a,int b) { if (a<b) return a; return b; }
ll min(int a,ll b) { if (a<b) return a; return b; }
ll max(ll a,int b) { if (a>b) return a; return b; }
ll max(int a,ll b) { if (a>b) return a; return b; }

string to_upper(string a) { for (int i=0;i<(int)a.size();++i) if (a[i]>='a' && a[i]<='z') a[i]-='a'-'A'; return a; }
string to_lower(string a) { for (int i=0;i<(int)a.size();++i) if (a[i]>='A' && a[i]<='Z') a[i]+='a'-'A'; return a; }
bool prime(ll a) { if (a==1) return 0; for (int i=2;i<=round(sqrt(a));++i) if (a%i==0) return 0; return 1; }
void yes() { cout<<"YES\n"; }
void no() { cout<<"NO\n"; }

/*  All Required define Pre-Processors and typedef Constants */
typedef long int int32;
typedef unsigned long int uint32;
typedef long long int int64;
typedef unsigned long long int  uint64;
const int N = 200005;
int fact[N];

void factorial() {
    fact[0] = 1;
    for (int i=1  ; i<N ; i++) {
        fact[i] = (fact[i-1]*i)%MOD;
    }
}

/* clang-format on */

ll power(ll a, ll b) {
    if (b == 0) {
        return 1;
    }

    ll ans = power(a, b / 2);
    ans *= ans;
    ans %= MOD;
    if (b % 2) {
        ans *= a;
    }
    return ans % MOD;
}

void solve() {
    // write code here
    return;
}

/* Main()  function */
int main() {
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
// freopen("output.txt","w",stdout);
#endif

    int tc;
    cin >> tc;

    while (tc--) {
        solve();
    }
    return 0;
}
/* Main() Ends Here */