hkr

#include <chrono>
#include <iostream>
#include <random>
using namespace std;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

#define Jungle ""
#define MASK(i) (1 << (i))
#define getbit(x, i) (((x) >> (i)) & 1)
#define cntbit(x) __builtin_popcount(x)
#define _(x) ((x) & -(x))
#define MULTEST    \
 int numtest;   \
 read(numtest); \
 for (; numtest; --numtest)

template &lt;typename t>
void mini(t &a, t b)
{
 if (a > b)
     a = b;
}

template &lt;typename t>
void maxi(t &a, t b)
{
 if (a < b)
     a = b;
}

const int mod = 1e9 + 7;

int add(const int &x, const int &y)
{
 return (1ll * x + y) % mod;
}

int sub(const int &x, const int &y)
{
 return (1ll * x - y + mod) % mod;
}

int mul(const int &x, const int &y)
{
 return 1ll * x * y % mod;
}

template &lt;typename t>
void read(t &x)
{
 cin >> x;
}

const int maxn = 0;
const bool is_debug = 1;

void init(void)
{
}

void solve(void)
{
 init();
}

int main()
{
 ios_base::sync_with_stdio(0);
 cin.tie(nullptr);
 cout.tie(nullptr);

 if (fopen(Jungle ".inp", "r"))
 {
     freopen(Jungle ".inp", "r", stdin);
     freopen(Jungle ".out", "w", stdout);
 }

 // MULTEST
 solve();

 // cerr << "\nTime elapsed: " << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";

 return 0;
}