//3129504552
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 0x3f3f3f3f
#define PII pair<int,int>
#define rep(k,a,b) for (int k = a;k <= b;k++)
#define adde(a,b) v[a].push_back(b)
#define addev(a,b,c) v[a].push_back({b,c});
#define rd read
#define all(a) a.begin(),a.end()
#define mem(a,b) memset(a,b,sizeof a);
#define pb push_back
#define vct vector
#define rev(T) reverse(T.begin(),T.end())
#define endl "\n"
#define sz(a) ((int)a.size())
#define range(a,l,r) a.begin() + l,a.begin() + r + 1
void solvemain()
{
}
signed main()
{
ios::sync_with_stdio(false);cin.tie(nullptr);
int t;t = 1;
while(t--){solvemain();}return 0;
}
//离谱肉澳门pv20鈤
/usr/bin/time -v
ulimit 限制空间
fsanitize
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> t;
int main()
{
return 0;
}
-std=c++14 -O2 -Wall -Wl,--stack=1234567890 -D_GLIBCXX_DEBUG -Wextra -Wshadow