#include <cstdio>
#include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <ctime>
#include <random>
#include <cassert>
#include <numeric>
#include <cmath>
#include <bitset>
#include <ext/pb_ds/assoc_container.hpp>
#define pii pair<int, int>
#define fi first
#define se second
#define MP make_pair
#define ep emplace
#define eb emplace_back
#define int long long
#define rep(i, j, k) for (int i = (j); i <= (k); i++)
#define per(i, j, k) for (int i = (j); i >= (k); i--)
typedef double db;
typedef long double ldb;
typedef long long ll;
//typedef __int128 lll;
typedef unsigned long long ull;
typedef unsigned int ui;
using namespace std;
using namespace __gnu_pbds;
bool Mbe;

//char buf[1<<20],*p1,*p2;
//#define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf,1,1<<20,stdin), p1 == p2) ? 0 : *p1++)
int read() {
	int s = 0, f = 1;
	char c = getchar();
	while (c < '0' || c > '9') f ^= (c == '-'), c = getchar();
	while (c >= '0' && c <= '9') s = s * 10 + c - '0', c = getchar();
	return f ? s : -s;
}
template<typename T>void chkmax(T&x,const T&y){if(x<y)x=y;}
template<typename T>void chkmin(T&x,const T&y){if(x>y)x=y;}

const int mod=1e9+7;
int fpow(int x,int k){
	int res=1;
	for(;k;k>>=1){
		if(k&1)res=res*x%mod;
		x=x*x%mod;
	}
	return res;
}
int n,k,a[45],val[1<<24],pw[45],b[45],ans,dp[45][1<<20];
int w[45];
bool insert(int x){
	per(i,43,0){
		if(x>>i&1){
			if(!w[i])return w[i]=x,1;
			x^=w[i];
		}
	}
	return 0;
}

bool Med;
signed main() {
	fprintf(stderr,"%.3lfMb\n",(&Mbe-&Med)/1024./1024.);
	n=read(),k=read();
	int cnt=0;
	rep(i,0,44)pw[i]=fpow(i,k);
	rep(i,0,n-1){
		if(insert(a[i]=read())){
			b[cnt++]=i;
		}
	}
	per(i,43,0)if(w[i])per(j,i+1,43)if(w[j]>>i&1)cout<<"WTF";
//		for(i=W-1;~i;--i) if(p[i]) for(j=i+1;j<W;++j) if((p[j]>>i)&1) p[j]^=p[i];
	if(cnt<=24){
		rep(S,1,(1<<cnt)-1){
			val[S]=val[S^(S&-S)]^a[b[__lg(S&-S)]];
			ans=(ans+pw[__builtin_popcountll(val[S])])%mod;
		}
	}else{
		int nn=(1ll<<(44-cnt))-1;
		dp[0][0]=1;
		rep(i,0,cnt-1){
			int sum=0;
			per(j,b[i],0)if(!w[j])sum=sum<<1|(w[b[i]]>>j&1);
			per(j,i,0)rep(S,0,nn)dp[j+1][S^sum]=(dp[j+1][S^sum]+dp[j][S])%mod;
		}
		rep(i,1,cnt)rep(S,0,nn)ans=(ans+dp[i][S]*pw[i+__builtin_popcountll(S)]);
	}
	ans=ans*fpow(2,n-cnt)%mod;
	printf("%lld\n",ans);
	return 0;
}