define file

// learn from notonlysuccess

#pragma once
#pragma warning (disable:4786)
#pragma warning (disable:4996)

#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <cstring>
#include <cmath>
#include <ctime>

#include <iostream>
#include <algorithm>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <queue>
#include <list>
using namespace std;

typedef long LG;
typedef long long LLG;
typedef unsigned long ULG;

typedef vector<int> VI;
typedef vector<VI> VII;
typedef map<int, int> MII;
typedef map<string, int> MSI;

#define MM(m, what) memset( m, what, sizeof(m) )
#define FOR(i, a, b) for( i = (a); i < (b); ++ i )
#define FF(i, a) for( i = 0; i < (a); ++ i )
#define FFD(i, a) for( i=(a)-1; i >= 0; -- i )

#define PP(a) printf("%d\n", (a));
#define PN(i,n,a) FF(i,n) printf("%d%c", a[i], i==n-1?'\n':' ')
#define PNM(i,n,j,m,a) FF(i,n) FF(j,m) printf("%d%c", a[i][j], j==m-1?'\n':' ')

#define SS(a) scanf("%d",&a);
#define SN(i,n,a) FF(i,n) SS(a[i])
#define SNM(i,n,j,m,a) FF(i,n) FF(j,m) SS(a[i][j])

#define ASA(a) assert(a)
#define ASAB(m, a, n) assert(m <= a && a <= n)

#define LL(a) ( (a) << 1 )
#define RR(a) ( ((a) << 1) | 1 )
#define OL(a) ( 1 << (a))

#define read freopen("in.txt", "r", stdin)
#define write freopen("ou.txt", "w", stdout)

const int inf = 0x7fffffff;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
const double eps = 1e-11;
const double Pi = acos(-1.);

template<typename T> inline T countBit(T n) {	return n?1+countBit(n&(n-1)):0; }
template<typename T> inline T sqr(T a) { return a*a; }
template<typename T> inline void checkMin(T & a, T b) { if(a == -1 || a > b) a = b; }
template<typename T> inline void checkMax(T & a, T b) { if(a < b) a = b; }

// by swrd