int Pow(int x,int y){    int ans=1;    for (;y;y>>=1,x=1LL*x*x%mod)        if (y&1)            ans=1LL*ans*x%mod;    return ans;}void FWT(int a[],int n,int flag){    for (int d=1;d
     
      <<=1)        for (int i=0;i
      
       <<1))            for (int j=0;j
       
        0;}