template.cpp

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <set>
#include <vector>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <math.h>
#include <map>
#include <deque>
#include <queue>
#include <climits>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(v) sort(v.begin(), v.end())
#define SORTFUNC(v, func) sort(v.begin(), v.end(), func)
#define PRINT(v) REP(i, v.size()) printf("%d ", v[i]); cout << endl
#define SCI(n) int (n); scanf("%d", &(n))
#define SCL(n) ll (n); scanf("%I64d", &(n))
#define IN(n) scanf("%d", &(n))
#define INL(n) scanf("%I64d", &(n))
#define pb push_back

int main(){

}