```json↵
{↵
"__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<=I##_; ++I)",↵
"#define rep(I,A,B) for(int I=(A), I##_=(B); I<=I##_; ++I)",↵
"#define repo(I,A,B) for(int I=(A), I##_=(B); I< I##_; ++I)",↵
"#define REPO(I,A,B) for( LL I=(A), I##_=(B); I< I##_; ++I)",↵
"#define reb(I,A,B) for(int I=(A), I##_=(B); I>=I##_; --I)",↵
"#define REB(I,A,B) for( LL I=(A), I##_=(B); I>=I##_; --I)",↵
"#define rebo(I,A,B) for(int I=(A), I##_=(B); I> I##_; --I)",↵
"#define REBO(I,A,B) for( LL I=(A), I##_=(B); I> I##_; --I)",↵
"#define rea(I,A,B,C) for(int I=(A), I##_=(B), I##__=(C); (I##__>0)? (I<=I##_):(I>=I##_); I+=I##__)",↵
"#define REA(I,A,B,C) for( LL I=(A), I##_=(B), I##__=(C); (I##__>0)? (I<=I##_):(I>=I##_); I+=I##__)",↵
"#define reao(I,A,B,C) for(int I=(A), I##_=(B), I##__=(C); (I##__>0)? (I< I##_):(I> I##_); I+=I##__)",↵
"#define REAO(I,A,B,C) for( LL I=(A), I##_=(B), I##__=(C); (I##__>0)? (I< I##_):(I> I##_); I+=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)",↵
↵
"#define rem(I,A,B,C) for(int I=(A), I##_=Abs(B), I##__=(C); I&&Abs(I)<=I##_; (INT_MAX / Abs(I) < Abs(I##__))? (I=0):(I*=I##__))",↵
"#define REM(I,A,B,C) for( LL I=(A), I##_=Abs(B), I##__=(C); I&&Abs(I)<=I##_; (LLONG_MAX / Abs(I) < Abs(I##__))? (I=0):(I*=I##__))",↵
"#define remo(I,A,B,C) for(int I=(A), I##_=Abs(B), I##__=(C); I&&Abs(I)< I##_; (INT_MAX / Abs(I) < Abs(I##__))? (I=0):(I*=I##__))",↵
"#define REMO(I,A,B,C) for( LL I=(A), I##_=Abs(B), I##__=(C); I&&Abs(I)< I##_; (LLONG_MAX / Abs(I) < Abs(I##__))? (I=0):(I*=I##__))",↵
"#define rex(I,A,B,C) for(int I=(A), I##_=Abs(B), I##__=(C); Abs(I)>=I##_; I/=I##__)",↵
"#define REX(I,A,B,C) for( LL I=(A), I##_=Abs(B), I##__=(C); Abs(I)>=I##_; I/=I##__)",↵
"#define rexo(I,A,B,C) for(int I=(A), I##_=Abs(B), I##__=(C); Abs(I)> I##_; I/=I##__)",↵
"#define REXO(I,A,B,C) for( LL I=(A), I##_=Abs(B), I##__=(C); Abs(I)> I##_; I/=I##__)",↵
"#define rel(I,A,B) for(int I=(A), I##_=Abs(B); I&&Abs(I)<=I##_; (Abs(I)>( INT_MAX>>1))? (I=0):(I<<=1))",↵
"#define REL(I,A,B) for( LL I=(A), I##_=Abs(B); I&&Abs(I)<=I##_; (Abs(I)>(LLONG_MAX>>1))? (I=0):(I<<=1))",↵
"#define relo(I,A,B) for(int I=(A), I##_=Abs(B); I&&Abs(I)< I##_; (Abs(I)>( INT_MAX>>1))? (I=0):(I<<=1))",↵
"#define RELO(I,A,B) for( LL I=(A), I##_=Abs(B); I&&Abs(I)< I##_; (Abs(I)>(LLONG_MAX>>1))? (I=0):(I<<=1))",↵
"#define rer(I,A,B) for(int I=(A), I##_=Abs(B); Abs(I)>=I##_; I>>=1)",↵
"#define RER(I,A,B) for( LL I=(A), I##_=Abs(B); Abs(I)>=I##_; I>>=1)",↵
"#define rero(I,A,B) for(int I=(A), I##_=Abs(B); Abs(I)> I##_; I>>=1)",↵
"#define RERO(I,A,B) for( LL I=(A), I##_=Abs(B); Abs(I)> I##_; I>>=1)",↵
"template<typename T> T Abs(T x) {return x<0? -x:x; }",↵
"",↵
"//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 Puts(S) cout<<(S)<<'\\n'",↵
"#define Putw(S) cout<<(S)<<' '",↵
"",↵
"//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;",↵
"}"↵
]↵
},↵
}↵
```
{↵
"__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<=I##_; ++I)",↵
"#define rep(I,A,B) for(int I=(A), I##_=(B); I<=I##_; ++I)",↵
"#define repo(I,A,B) for(int I=(A), I##_=(B); I< I##_; ++I)",↵
"#define REPO(I,A,B) for( LL I=(A), I##_=(B); I< I##_; ++I)",↵
"#define reb(I,A,B) for(int I=(A), I##_=(B); I>=I##_; --I)",↵
"#define REB(I,A,B) for( LL I=(A), I##_=(B); I>=I##_; --I)",↵
"#define rebo(I,A,B) for(int I=(A), I##_=(B); I> I##_; --I)",↵
"#define REBO(I,A,B) for( LL I=(A), I##_=(B); I> I##_; --I)",↵
"#define rea(I,A,B,C) for(int I=(A), I##_=(B), I##__=(C); (I##__>0)? (I<=I##_):(I>=I##_); I+=I##__)",↵
"#define REA(I,A,B,C) for( LL I=(A), I##_=(B), I##__=(C); (I##__>0)? (I<=I##_):(I>=I##_); I+=I##__)",↵
"#define reao(I,A,B,C) for(int I=(A), I##_=(B), I##__=(C); (I##__>0)? (I< I##_):(I> I##_); I+=I##__)",↵
"#define REAO(I,A,B,C) for( LL I=(A), I##_=(B), I##__=(C); (I##__>0)? (I< I##_):(I> I##_); I+=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)",↵
↵
"#define rem(I,A,B,C) for(int I=(A), I##_=Abs(B), I##__=(C); I&&Abs(I)<=I##_; (INT_MAX / Abs(I) < Abs(I##__))? (I=0):(I*=I##__))",↵
"#define REM(I,A,B,C) for( LL I=(A), I##_=Abs(B), I##__=(C); I&&Abs(I)<=I##_; (LLONG_MAX / Abs(I) < Abs(I##__))? (I=0):(I*=I##__))",↵
"#define remo(I,A,B,C) for(int I=(A), I##_=Abs(B), I##__=(C); I&&Abs(I)< I##_; (INT_MAX / Abs(I) < Abs(I##__))? (I=0):(I*=I##__))",↵
"#define REMO(I,A,B,C) for( LL I=(A), I##_=Abs(B), I##__=(C); I&&Abs(I)< I##_; (LLONG_MAX / Abs(I) < Abs(I##__))? (I=0):(I*=I##__))",↵
"#define rex(I,A,B,C) for(int I=(A), I##_=Abs(B), I##__=(C); Abs(I)>=I##_; I/=I##__)",↵
"#define REX(I,A,B,C) for( LL I=(A), I##_=Abs(B), I##__=(C); Abs(I)>=I##_; I/=I##__)",↵
"#define rexo(I,A,B,C) for(int I=(A), I##_=Abs(B), I##__=(C); Abs(I)> I##_; I/=I##__)",↵
"#define REXO(I,A,B,C) for( LL I=(A), I##_=Abs(B), I##__=(C); Abs(I)> I##_; I/=I##__)",↵
"#define rel(I,A,B) for(int I=(A), I##_=Abs(B); I&&Abs(I)<=I##_; (Abs(I)>( INT_MAX>>1))? (I=0):(I<<=1))",↵
"#define REL(I,A,B) for( LL I=(A), I##_=Abs(B); I&&Abs(I)<=I##_; (Abs(I)>(LLONG_MAX>>1))? (I=0):(I<<=1))",↵
"#define relo(I,A,B) for(int I=(A), I##_=Abs(B); I&&Abs(I)< I##_; (Abs(I)>( INT_MAX>>1))? (I=0):(I<<=1))",↵
"#define RELO(I,A,B) for( LL I=(A), I##_=Abs(B); I&&Abs(I)< I##_; (Abs(I)>(LLONG_MAX>>1))? (I=0):(I<<=1))",↵
"#define rer(I,A,B) for(int I=(A), I##_=Abs(B); Abs(I)>=I##_; I>>=1)",↵
"#define RER(I,A,B) for( LL I=(A), I##_=Abs(B); Abs(I)>=I##_; I>>=1)",↵
"#define rero(I,A,B) for(int I=(A), I##_=Abs(B); Abs(I)> I##_; I>>=1)",↵
"#define RERO(I,A,B) for( LL I=(A), I##_=Abs(B); Abs(I)> I##_; I>>=1)",↵
"template<typename T> T Abs(T x) {return x<0? -x:x; }",↵
"",↵
"//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 Puts(S) cout<<(S)<<'\\n'",↵
"#define Putw(S) cout<<(S)<<' '",↵
"",↵
"//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;",↵
"}"↵
]↵
},↵
}↵
```
