头文件(模板)

// #pragma GCC optimize(1)
// #pragma GCC optimize(2)
// #pragma GCC optimize(3,"Ofast","inline")

#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include<set>
#include<queue>
#include<map>
#include<cmath>
#include<deque>
#include<bitset>
using namespace std;
typedef pair<int,int>PII;
typedef pair<int,char>PIC;
typedef pair<int,pair<int,int> > PPI;
#define mest(x,y) memset(x,y,sizeof x)
#define endl "\n"
#define all(x) x.begin(), x.end()
#define int long long
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define fi first 
#define se second 
#define ppb pop_back
#define pb push_back
#define rep(i, l, r) for(int i = l; i <= (r); ++ i)
#define per(i, r, l) for(int i = r; i >= (l); -- i)
#define reps(i, l, r, d) for(int i = l; i <= (r); i += d)
#define pers(i, r, l, d) for(int i = r; i >= (l); i -= d)
const int N = 1e6+10,M=N*2;
const int MOD = 998244353;
const int INF = 0x3f3f3f3f3f3f3f3f;
int h[N],ne[M],e[M],idx;
void solve()
{
  return ;
}
signed main()
{
    IOS;
    int t = 1;
    while(t--)
    {
      solve();
    }
    
      return 0;
}