头文件模板

/********************* Template ************************/
#include <set>
#include <map>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <cstdio>
#include <string>
#include <vector>
#include <cassert>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iomanip>
#include <iostream>
#include <algorithm>
using namespace std;
#define EPS             (1e-8)
#define MAXN            (1000050)
#define MAXE            (1000050)
#define DINF            (1e15)
#define INF             (0x3f3f3f3f)
#define LINF            (1LL<<62)
#define MOD             (1000000007)
#define PI              (3.14159265358979323846264338)
#define LINE            cout<<" ------------------ "<<endl
#define FIN             freopen("in.txt","r",stdin)
#define FOUT            freopen("out.txt","w",stdout)
#define lson            l,m,rt<<1
#define rson            m+1,r,rt<<1|1
#pragma comment         (linker,"/STACK:102400000,102400000")
template<class T> inline int dcmp(double x)     {if(x < -EPS) return -1; else if(x > EPS) return 1; return 0;}
template<class T> inline T L(T a)               {return (a << 1);}
template<class T> inline T R(T a)               {return (a << 1 | 1);}
template<class T> inline T lowbit(T a)          {return (a & -a);}
template<class T> inline T Mid(T a,T b)         {return ((a + b) >> 1);}
template<class T> inline T gcd(T a,T b)         {return b ? gcd(b,a%b) : a;}
template<class T> inline T lcm(T a,T b)         {return a / gcd(a,b) * b;}
template<class T> inline T Min(T a,T b)         {return a < b ? a : b;}
template<class T> inline T Max(T a,T b)         {return a > b ? a : b;}
template<class T> inline T Min(T a,T b,T c)     {return Min(Min(a,b),c);}
template<class T> inline T Max(T a,T b,T c)     {return Max(Max(a,b),c);}
template<class T> inline T Min(T a,T b,T c,T d) {return Min(Min(a,b),Min(c,d));}
template<class T> inline T Max(T a,T b,T c,T d) {return Max(Max(a,b),Max(c,d));}
template<class T> inline T ABS(T a)             {return (a > 0 ? a : -a);}
template<class T> inline T mod(T x,T y)         {y = ABS(y); return x >= 0 ? x % y : x % y + y;}
template<class T> inline T mul_mod(T a,T b,T n) {
    T ret = 0,tmp = a % n;
    while(b){
        if((b&1) && (ret+=tmp)>=n) ret -= n;
        if((b>>=1) && (tmp<<=1)>=n) tmp -= n;
    }return ret;
}
template<class T> inline T pow_mod(T a,T b,T n) {
    T ret = 1; a = a % n;
    while(b){
        if (b&1) ret = mul_mod(ret,a,n);
        if (b>>=1) a = mul_mod(a,a,n);
    }return ret;
}
template<class T> inline T exGCD(T a, T b, T &x, T &y) {
    if(!b) return x = 1,y = 0,a;
    T res = exGCD(b,a%b,x,y),tmp = x;
    x = y,y = tmp - (a / b) * y;
    return res;
}
template<class T> inline T reverse_bits(T x) {
    x = ((x >> 1) & 0x55555555) | ((x << 1) & 0xaaaaaaaa);
    x = ((x >> 2) & 0x33333333) | ((x << 2) & 0xcccccccc);
    x = ((x >> 4) & 0x0f0f0f0f) | ((x << 4) & 0xf0f0f0f0);
    x = ((x >> 8) & 0x00ff00ff) | ((x << 8) & 0xff00ff00);
    x = ((x >>16) & 0x0000ffff) | ((x <<16) & 0xffff0000);
    return x;
}
typedef long long LL;    typedef unsigned long long ULL;
//typedef __int64 LL;      typedef unsigned __int64 ULL;
/*********************   By  F   *********************/

int main(){
    return 0;
}

#include <cmath>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
template<class T> inline T lcm(T a,T b)         {return a / __gcd(a,b) * b;}
template<class T> inline T Min(T a,T b,T c)     {return min(min(a,b),c);}
template<class T> inline T Max(T a,T b,T c)     {return max(max(a,b),c);}
template<class T> inline T ABS(T a)             {return (a > 0 ? a : -a);}
typedef long long LL;    typedef unsigned long long ULL;
const int INF     = 0x3f3f3f3f;
const int MOD     = 1000000007;
const LL LINF     = (1LL<<62);
const double EPS  = 1e-8;
const double DINF = 1e15;
const double PI   = acos(-1);

const int MAXN = 100000;
int main(){
    return 0;
}

#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <stack>
#include <bitset>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
using namespace std;
#define EPS             (1e-8)
#define MAXN            (1000050)
#define MAXE            (1000050)
#define DINF            (1e15)
#define INF             (0x3f3f3f3f)
#define LINF            (1LL<<62)
#define MOD             (1000000007)
#define PI              (3.14159265358979323846)
#define LINE            cout<<" ------------------ "<<endl
#define lson            l,m,rt<<1
#define rson            m+1,r,rt<<1|1
template<class T> inline int dcmp(double x)     {if(x < -EPS) return -1; else if(x > EPS) return 1; return 0;}
template<class T> inline T L(T a)               {return (a << 1);}
template<class T> inline T R(T a)               {return (a << 1 | 1);}
template<class T> inline T lowbit(T a)          {return (a & -a);}
template<class T> inline T lcm(T a,T b)         {return a / __gcd(a,b) * b;}
template<class T> inline T Min(T a,T b,T c)     {return min(min(a,b),c);}
template<class T> inline T Max(T a,T b,T c)     {return max(max(a,b),c);}
template<class T> inline T ABS(T a)             {return (a > 0 ? a : -a);}
class $CLASSNAME${
    public:
    $RC$ $METHODNAME$($METHODPARMS$) {
        $CARETPOSITION$
    }
    $TESTCODE$
};

// BEGIN CUT HERE
int main(){
    $CLASSNAME$ ___test;
    ___test.run_test(-1);
    return 0;
}
// END CUT HERE