//#define _GLIBCXX_DEBUG #include using namespace std; #define endl '\n' #define lfs cout<= (ll)(n); i--) using ll = long long; using ld = long double; const ll MOD1 = 1e9+7; const ll MOD9 = 998244353; const ll INF = 1e18; using P = pair; templatebool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;} templatebool chmax(T1 &a,T2 b){if(avoid ans(bool x,T1 y,T2 z){if(x)cout<void debug(vector>&v,ll h,ll w){for(ll i=0;i&v,ll h,ll w){for(ll i=0;ivoid debug(vector&v,ll n){if(n!=0)cout<vector>vec(ll x, ll y, T w){vector>v(x,vector(y,w));return v;} ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;} vectordx={1,-1,0,0,1,1,-1,-1};vectordy={0,0,1,-1,1,-1,1,-1}; templatevector make_v(size_t a,T b){return vector(a,b);} templateauto make_v(size_t a,Ts... ts){return vector(a,make_v(ts...));} templateostream &operator<<(ostream &os, const pair&p){return os << p.first << " " << p.second;} templateostream &operator<<(ostream &os, const vector &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;} templatevoid rearrange(vector&ord, vector&v){ auto tmp = v; for(int i=0;ivoid rearrange(vector&ord,Head&& head, Tail&&... tail){ rearrange(ord, head); rearrange(ord, tail...); } //mt19937 mt(chrono::steady_clock::now().time_since_epoch().count()); int popcount(ll x){return __builtin_popcountll(x);}; int poplow(ll x){return __builtin_ctzll(x);}; int pophigh(ll x){return 63 - __builtin_clzll(x);}; namespace BitConvolution{ template vector or_zeta(const vector &v){ vector ret = v; for(int i = 1; i < v.size(); i <<= 1){ for(int j = 0; j < v.size(); j++){ if(i & j)ret[j] += ret[j^i]; } } return ret; } template vector or_meb(const vector &v){ vector ret = v; for(int i = 1; i < v.size(); i <<= 1){ for(int j = 0; j < v.size(); j++){ if(i & j)ret[j] -= ret[j^i]; } } return ret; } template vector and_zeta(const vector &v){ vector ret = v; for(int i = 1; i < v.size(); i <<= 1){ for(int j = 0; j < v.size(); j++){ if(i & j)ret[j^i] += ret[j]; } } return ret; } template vector and_meb(const vector &v){ vector ret = v; for(int i = 1; i < v.size(); i <<= 1){ for(int j = 0; j < v.size(); j++){ if(i & j)ret[j^i] -= ret[j]; } } return ret; } template vector xor_zeta(const vector &v){ vector ret = v; for(int i = 1; i < v.size(); i <<= 1){ for(int j = 0; j < v.size(); j++){ if((i & j) == 0){ T x = ret[j], y = ret[j | i]; ret[j] = x + y, ret[j | i] = x - y; } } } return ret; } template vector xor_meb(const vector &v){ vector ret = v; for(int i = 1; i < v.size(); i <<= 1){ for(int j = 0; j < v.size(); j++){ if((i & j) == 0){ T x = ret[j], y = ret[j | i]; ret[j] = (x + y) >> 1, ret[j | i] = (x - y) >> 1; } } } return ret; } template vector xor_conv(const vector &a, const vector &b){ auto az = xor_zeta(a); auto bz = xor_zeta(b); for(int i = 0; i < az.size(); i++){ az[i] *= bz[i]; } return xor_meb(az); } }; int main(){ cin.tie(nullptr); ios_base::sync_with_stdio(false); ll res=0,buf=0; bool judge = true; ll n,x;cin>>n>>x; vectora(n); rep(i,0,n)cin>>a[i]; using namespace BitConvolution; vectorb(1<<18); rep(i,0,n)b[a[i]]++; auto xa=xor_conv(b,b); ll all=0; rep(i,0,min(xa.size(),x))all+=xa[i]; all-=n;all/=2; rep(i,0,18){ vectorc(1<<18); ll num=0; rep(j,0,n){ if(~a[j]&1<(xc.size(),x))dif+=xc[i]; dif/=2; res+=(all-dif)*(1LL<