#include<bits/stdc++.h>
#define ll long long
#define ppc(x) __builtin_popcount(x)
using namespace std;
const ll md = 1e9+7;
ll fp(ll x,int p = md-2){
	ll res = 1;
	while(p){
		if(p&1)res = res*x%md;
		x = x*x%md;
		p>>=1;
	}
	return res;
}
ll a[50],bs[50] = {1},ji[50],jv[50],jsz,cc[50],f[45][1<<19],jx;
int n,K,id[50];
void dfs(int p,ll v){
	if(p==jsz+1){
		cc[ppc(v)]++;
		return;
	}
	dfs(p+1,v);
	dfs(p+1,v^ji[p]);
}
bool cmp(int x,int y){
	return jv[x]<jv[y];
}
int main(){
	for(int i = 1;i<44;i++)bs[i] = bs[i-1]<<1;
	scanf("%d%d",&n,&K);
	ll apw = 1;
	for(int i = 1;i<=n;i++){
		scanf("%lld",&a[i]);
		for(int j = 1;j<=jsz;j++){
			if(a[i]&jv[j])a[i]^=ji[j];
		}
		if(a[i]){
			ji[++jsz] = a[i];
			id[jsz] = jsz;
			jv[jsz] = *(upper_bound(bs,bs+44,a[i])-1);
			for(int j = 1;j<jsz;j++){
				if(ji[j]&jv[jsz])ji[j]^=ji[jsz];
			}
			jx|=jv[jsz];
		}else apw = apw*2%md;
	}
	ll ans = 0;
	if(jsz<=25)dfs(1,0);
	else{
		sort(id+1,id+jsz+1,cmp);
		ll nv,np;
		int cj = 0;
		for(int i = 1,p;i<=jsz;i++){
			nv = 0;
			p = ji[id[i]];
			cj = 0;
			for(int j = 0;j<44;j++){
				if(!(jx&(1LL<<j)))nv|=((ji[p]>>j)&1)<<(cj++);
			}
			np = 1<<cj;
			for(int j = i;j>1;j--){
				for(int k = 0;k<np;k++){
					(f[j][k]+=f[j-1][k^nv])%=md;
				}
			}
			(f[1][nv]+=1)%=md;
		}
		for(int i = 1;i<=jsz;i++){
			for(int k = 0;k<np;k++){
				(cc[i+ppc(k)]+=f[i][k])%=md;
			}
		}
	}
	for(int i = 1;i<=44;i++)(ans+=fp(i,K)*cc[i])%=md;
	printf("%lld\n",ans*apw%md);
	return 0;
}