#include<bits/stdc++.h>
#define int long long
#define lowbit(x) (x&(-x))
using namespace std;
inline int read(){
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-f;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
int buf[30];
inline void print(int x,char ch=' '){
	if(x<0) putchar('-'),x=-x;
	int tot=0;
	do{
		buf[++tot]=x%10;
		x/=10;
	}while(x);
	for(int i=tot;i>=1;i--)
		putchar(buf[i]+'0');
	putchar(ch);
}
const int mod=1e9+7;
int qpow(int a,int b){
	int ans=1,base=a;
	while(b){
		if(b&1) ans=ans*base%mod;
		base=base*base%mod;
		b>>=1;
	}
	return ans;
}
int n,k,a[44];
int p[44];
bool insert(int x){
	for(int i=43;i>=0;i--){
		if((x>>i&1)&&!p[i]){
			p[i]=x;
			return 1;
		}		
		else if(x>>i&1)
			x^=p[i];
	}
	return 0;
}

int pw[45],dp[1<<22];
int solve1(){
	int m=0,ans=0;
	for(int i=0;i<44;i++)
		if(p[i]) dp[1<<m++]=p[i];
	for(int i=0;i<=44;i++) pw[i]=qpow(i,k);
	for(int mask=1;mask<(1<<m);mask++){
		dp[mask]=dp[mask^lowbit(mask)]^dp[lowbit(mask)];
		int b=__builtin_popcountll(dp[mask]);
		ans=(ans+(1ll<<n-m)%mod*pw[b])%mod;
	}
	return ans;
}
signed main(){
	n=read(),k=read();
	for(int i=0;i<n;i++) a[i]=read();
	
	int cnt=0;
	for(int i=0;i<n;i++)
		cnt+=insert(a[i]);
	if(cnt<=22)
		print(solve1());
	return 0;
}