#include #define int long long #define all(v) v.begin(),v.end() #define rall(v) v.rbegin(),v.rend() bool st; using namespace std; templateistream&operator>>(istream&I,vector&v){for(auto&i:v)I>>i;return I;} templateostream&operator<<(ostream&O,vector v){for(auto i:v)O<>=1; } return res; } void init(){ fac[0]=1; for(int i=1;i<=400000;i++)fac[i]=fac[i-1]*i%mod; inv[400000]=qpow(fac[400000],mod-2); for(int i=399999;i>=0;i--)inv[i]=inv[i+1]*(i+1)%mod; } int C(int n,int m){ if(n<0||m<0||n>n; for(int i=n;i<=2*n;i+=2){ int y=(i-n)/2; int x=i-y-1; int tmp=C(x+y,x)-C(x+y,y-1)+mod; ans=(ans+tmp)%mod; } cout<>t; while(t--)AC::solve(); chrono::steady_clock::time_point ED=chrono::steady_clock::now(); cerr<(ED-St).count()<<" \tms\n"<<"Real Time : "<(ED-ST).count()<<" \tms\n"<<" : "<(ED-ST).count()<<" \t?s\n\n"<<"Total Memory : "<