{
"__1csdm__": {
"prefix": "__1csdm__",
"body": [
"#include<bits/stdc++.h>",
"using namespace std;",
"typedef long long LL;  typedef unsigned long long ULL;  typedef long double LD;",
"",
"//Loop Family",
"#define  REP(I,A,B) for( LL I=(A); I<=(B); ++I)",
"#define  rep(I,A,B) for(int I=(A); I<=(B); ++I)",
"#define repo(I,A,B) for(int I=(A); I< (B); ++I)",
"#define REPO(I,A,B) for( LL I=(A); I< (B); ++I)",
"#define  reb(I,A,B) for(int I=(A); I>=(B); --I)",
"#define  REB(I,A,B) for( LL I=(A); I>=(B); --I)",
"#define rebo(I,A,B) for(int I=(A); I> (B); --I)",
"#define REBO(I,A,B) for( LL I=(A); I> (B); --I)",
"#define repeat(A) reb(ID, (A), 1)",
"#define BtoE(I,A) for(auto I=A.begin(); I!=A.end(); ++I)",
"#define EtoB(I,A) for(auto I=A.rbegin(); I!=A.rend(); ++I)",
"",
"//STL container family",
"typedef vector<int> VI;  typedef vector<LL> VL;  typedef vector<char> VC; ",
"typedef vector<VI> VII, VVI;  typedef vector<VL> VLL, VVL;  typedef vector<VC> VCC, VVC; ",
"template<typename T> void push_back(vector<T>&v, const T& e) {",
"    v.size()==v.capacity() && v.size()>1 && (v.reserve(v.size() + (v.size()>>1)), true), v.push_back(e); }",
"#define FI first",
"#define SE second",
"typedef pair<int,int> pii;  typedef pair<int,LL> pil;  typedef pair<LL,int> pli;  typedef pair<LL,LL> pll; ",
"typedef map<int,int> mii;  typedef map<int,LL> mil;  typedef map<LL,int> mli;  typedef map<LL,LL> mll; ",
"typedef set<int> Si;  typedef set<LL> Sl;  typedef multiset<int> MSi;  typedef multiset<LL> MSl; ",
"#define maxHp(T) priority_queue<T>",
"#define minHp(T) priority_queue<T, vector<T>, greater<T> >",
"",
"//Math Family",
"#define M_GOLDEN 1.61803398874989484820",
"#define M_GAMMA 0.57721566490153286060",
"const int mod9=998244353, mod1=1000000007;  const LL MOD9=mod9, MOD1=mod1; ",
"constexpr int inf127=0x01010101, inf=inf127*127, inf2=inf127*63, inf3=inf127*42; ",
"constexpr LL INF127=0x0101010101010101, INF=INF127*127, INF2=INF127*63, INF3=INF127*42; ",
"LL fpw(LL x, LL y=MOD9-2, LL mo=MOD9) {",
"    if(mo==1||mo==-1) {return 0; }  LL ans=1;  ",
"    for(x%=mo; y>0; x=x*x%mo, y>>=1) {if(y&1) ans=ans*x%mo; }  return ans;  }",
"LL fpw1(LL x) { return fpw(x,mod1-2,mod1); }",
"",
"//Operation Family",
"#define Dsort(A,B,T) sort(A, B, greater<T>())",
"#define FileIO(A) freopen(A\".in\", \"r\", stdin), freopen(A\".out\", \"w\", stdout)",
"#define Memset(A, V) memset(A, V, sizeof(A))",
"#define Puta(S) cout<<(S)",
"#define Puts(S) cout<<(S)<<'\\n'",
"#define Putw(S) cout<<(S)<<' '",
"template<typename T> void PutArray(T B, T E) {",
"    for(auto it=B; it!=E; ++it) Puta(*it);     cout<<'\\n';  }",
"",
"//You can write your things here. ",
"",
"void initialize() {}",
"void resetdata() {}",
"void each_task() {}",
"bool __main(int taskID) {",
"    resetdata(); ",
"    ",
"    return 0;",
"}",
"",
"int main() {",
"    initialize();  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); ",
"    int tasks=1;  //cin>>tasks; ",
"    repo(taskID, 0, tasks) if(__main(taskID)) return 0; ",
"    return 0;",
"}"
]
},
}