板子板子板子

快读，空间占用很大。。

inline char nc() {
	static char buf[1000000], *p1 = buf, *p2 = buf;
	return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2) ? EOF : *p1++;
}
template <typename _Tp> inline void read(_Tp&sum) {
	char ch = nc(); sum = 0;
	while (!(ch >= '0'&&ch <= '9')) ch = nc();
	while (ch >= '0'&&ch <= '9') sum = (sum << 3) + (sum << 1) + (ch - 48), ch = nc();
}

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define de(a) cout<<#a<<' '<<a<<endl;
#define de2(a,b) cout<<#a<<' '<<a<<' '<<#b<<' '<<b<<endl;
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define RAND mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define grand(l,r) uniform_int_distribution<int>(l,r)(rng)
#define IO ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define endl '\n' 
#define fi first
#define se second
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define pb push_back
#define rep(i, a) for (int i = 0; i < (a); ++i)
#define rep1(i, a) for (int i = 1; i <= (a); ++i)
inline ll read()
{
    ll x=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9')
    {
        if(ch=='-')
        f=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9')
    {
        x=(x<<1)+(x<<3)+(ch^48);
        ch=getchar();
    }
    return x*f;
}
const double eps=1e-8;
const int N=1e5+10,mod=1e9+7;
ll qp(ll a,ll b)
{
    ll res=1;
    while(b)
    {
        if(b&1)res=res*a;
        b>>=1;
        a=a*a;
    }
    return res;
}

void solve()
{
    
}
int main()
{
    int t;
    //cin>>t;
    t=1;
    for(int i=1;i<=t;i++)
    {
    	solve();
    }
    return 0;
}

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define de(a) cout<<#a<<' '<<a<<endl;
#define de2(a,b) cout<<#a<<' '<<a<<' '<<#b<<' '<<b<<endl;
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define RAND mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define grand(l,r) uniform_int_distribution<int>(l,r)(rng)
#define IO ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define fi first
#define se second
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define pb push_back
#define rep(i, a) for (int i = 0; i < (a); ++i)
#define rep1(i, a) for (int i = 1; i <= (a); ++i)
inline ll read()
{
    ll x=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9')
    {
        if(ch=='-')
            f=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9')
    {
        x=(x<<1)+(x<<3)+(ch^48);
        ch=getchar();
    }
    return x*f;
}
const double eps=1e-7;
const int N=1e6+10,mod=998244353;
ll qp(ll a,ll b)
{
    ll res=1;
    while(b)
    {
        if(b&1)res=res*a;
        b>>=1;
        a=a*a;
    }
    return res;
}
void solve()
{
    
}
int main()
{
    int t;
    cin>>t;
    //t=1;
    for(int i=1;i<=t;i++)
    {
        //printf("Case #%d: ",i);
        solve();
    }
}

clion

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define de(a) cout<<#a<<' '<<a<<endl;
#define de2(a,b) cout<<#a<<' '<<a<<' '<<#b<<' '<<b<<endl;
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define RAND mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define grand(l,r) uniform_int_distribution<int>(l,r)(rng)
#define IO ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define fi first
#define se second
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define pb push_back
#define rep(i, a) for (int i = 0; i < (a); ++i)
#define rep1(i, a) for (int i = 1; i <= (a); ++i)
inline ll read()
{
    ll x=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9')
    {
        if(ch=='-')
            f=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9')
    {
        x=(x<<1)+(x<<3)+(ch^48);
        ch=getchar();
    }
    return x*f;
}
const double eps=1e-7;
const int N=1e6+10,mod=998244353;
ll qp(ll a,ll b)
{
    ll res=1;
    while(b)
    {
        if(b&1)res=res*a;
        b>>=1;
        a=a*a;
    }
    return res;
}
void solve()
{
    
}
int main()
{
    #ifdef LOCAL
    int begin_time = clock();
    freopen("../input.txt", "r", stdin);
    //    freopen("../output.txt", "w", stdout);
    #endif
    //ini();
    int t;
    cin>>t;
    //t=1;
    for(int i=1;i<=t;i++)
    {
        //printf("Case #%d:\n",i);
        solve();
    }
    #ifdef LOCAL
    int end_time = clock();
    printf("\nRun time: %.2lf ms", (double) (end_time - begin_time) / CLOCKS_PER_SEC * 1000);
    #endif
}