#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<n)return 0; if(k==0||k==n)return 1; if(n%2==0&&k%2==1)return 0; return calc(n/2,k/2); } void exgcd(int a,int b,int&x,int&y){ x=1; y=0; if(b!=0){ exgcd(b,a%b,y,x); y-=(a/b)*x; } } int inv(int v,int m){ int x,y; exgcd(v,m,x,y); return (x+m)%m; } const int N=3e6; const int mod=1<<24; int fac[N]; int bow[N]; bool bl=0; void solve(){ if(!bl){ bl=1; fac[0]=1; bow[0]=0; for(int i=1;i>a>>b>>c; if(c%2==0){ cout<<0<0){ x=x*2%mod; bin--; } x=(x+a-1+mod)%mod; int cnt=31-__builtin_clz(a)+1; cnt=(1<>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 : "<