封装了快读快写

// #pragma GCC optimize(2) 
// #define OJ
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define caseT int CaseT;scanf("%d", &CaseT);for(int _Case = 1; _Case <= CaseT; _Case++)

template <typename T> void inline read(T &x) {
    int f = 1; x = 0; char s = getchar();
    while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
    while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
    x *= f;
}
template <typename T1, typename T2> void inline read(T1 &a, T2 &b) { read(a), read(b); }
template <typename T1, typename T2, typename T3> void inline read(T1 &a, T2 &b, T3 &c) { read(a), read(b), read(c); }
template <typename T> inline void wr(T x){ if(x < 0) putchar('-'), x = -x; if(x >= 10) wr(x / 10); putchar(x % 10 + '0'); }
template <typename T1, typename T2> void inline wr(T1 &a, T2 &b) { wr(a), putchar(' '), wr(b), putchar('\n'); }
template <typename T> inline void wrn(T x, char end = '\n') { wr(x); putchar(end); }

typedef long long LL;
typedef pair <int, int> PII;
typedef pair<double, double> PDD;
typedef unsigned long long ULL;

//<--------------------------------------------------------------------->
/* 先检查数据范围 N MO 记得开long long 图论是不是无向边呢？*/
const int MO = 1e9 + 7;
const int N = 1e5 + 5;
const int INF = 0x3f3f3f3f;

int dx[8] = {-1, 0, 1, 0, -1, -1, 1, 1}, dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};

int main () {
    #ifdef OJ
        freopen("D:/vscode project/Codeforce/in.txt","r",stdin);
        freopen("D:/vscode project/Codeforce/out.txt","w",stdout);
    #endif 
    // IOS;



    return 0;
}