/*
* __----~~~~~~~~~~~------___
* . . ~~//====...... __--~ ~~
* -. \_|// |||\\ ~~~~~~::::... /~
* ___-==_ _-~o~ \/ ||| \\ _/~~-
* __---~~~.==~||\=_ -_--~/_-~|- |\\ \\ _/~
* _-~~ .=~ | \\-_ '-~7 /- / || \ /
* .~ .~ | \\ -_ / /- / || \ /
* / ____ / | \\ ~-_/ /|- _/ .|| \ /
* |~~ ~~|--~~~~--_ \ ~==-/ | \~--===~~ .\
* ' ~-| /| |-~\~~ __--~~
* |-~~-_/ | | ~\_ _-~ /\
* / \ \__ \/~ \__
* _--~ _/ | .-~~____--~-/ ~~==.
* ((->/~ '.|||' -_| ~~-/ , . _||
* -_ ~\ ~~---l__i__i__i--~~_/
* _-~-__ ~) \--______________--~~
* //.-~~~-~_--~- |-------~~~~~~~~
* //.-~~~--\
* ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
*
* 神兽保佑 永无BUG
*/
/*
* @Description: I want to be the weakest vegetable in the world!
* @Author: I.Z.
*/
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define speMOD 2933256077ll
#define int long long
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define pb push_back
#define REP(i,b,e) for(int i=(b);i<(int)(e);++i)
#define over(x) {cout<<(x)<<endl;return;}
#define lowbit(x) ((x)&(-(x)))
#define cntbit(x) __builtin_popcount(x)
#define deal(v) sort(all(v));v.erase(unique(v.begin(),v.end()),v.end())
#define lbound(v,x) lower_bound(all(v),x)-v.begin()
mt19937 sd(random_device{}());
int qpow(int a,int b,int m=MOD,int res=1){
a%=m;
while(b>0)res=(b&1)?(res*a%m):(res),a=a*a%m,b>>=1;
return res;
}
int exgcd(int x,int y,int &a,int &b){
if(y==0){
a=1;b=0;
return x;
}
int d=exgcd(y,x%y,a,b);
int z=b;
b=a-b*(x/y);
a=z;
return d;
}
int _x_,_y_;
inline int inverse(int x,int y=MOD){
exgcd(x,y,_x_,_y_);
return (_x_+y)%y;
}
int fac[2000005],inv[2000005];
void init(int n){
fac[0]=inv[0]=1;
REP(i,1,n+1)fac[i]=fac[i-1]*i%MOD;
inv[n]=qpow(fac[n],MOD-2);
for(int i=n-1;i>=1;--i)inv[i]=inv[i+1]*(i+1)%MOD;
}
int binom(int x,int y){
return x<y||y<0? 0:fac[x]*inv[y]%MOD*inv[x-y]%MOD;
}
int n,k,m=43;
int a[60];
int b[34000000];
int id[60];
int dp[50][600000];
void Main() {
cin>>n>>k;
REP(i,0,m+1)a[i]=-1;
int op=n==37&&k==855755785;
int c=0;
REP(i,0,n){
int x;
cin>>x;
for(int j=m;j>=0;--j)if((x>>j)&1){
if(a[j]==-1){a[j]=x;++c;break;}
else x^=a[j];
}
}
int mr=n-c;
if(c<=25){
b[0]=0;
vector<int>t;
REP(i,0,m+1)if(a[i]!=-1)t.pb(a[i]);
REP(i,0,c){
REP(j,0,(1<<i))b[j|(1<<i)]=b[j]^t[i];
}
vector<int>cnt(m+1,0);
REP(i,0,(1<<c))++cnt[__builtin_popcountll(b[i])];
int ans=0;
REP(i,0,m+1)(ans+=qpow(i,k)*cnt[i])%=MOD;
REP(i,c,n)(ans*=2)%=MOD;
over(ans)
}
n=0;int r=0;
REP(i,0,m+1)if(a[i]!=-1){
for(int j=i-1;j>=0;--j)if(((a[i]>>j)&1)&&a[j]!=-1)a[i]^=a[j];
}else id[i]=n++;
r=n;
vector<int>t;
REP(i,0,m+1)if(a[i]!=-1){
int x=0;
REP(j,0,m+1)if(a[j]==-1){
if((a[i]>>j)&1)x^=(1ll<<id[j]);
}
t.pb(x);
}
n=t.size();
if(op)cout<n<<' '<<mr<<' '<<r<<endl;
dp[0][0]=1;
REP(i,0,n){
for(int j=i;j>=0;--j){
REP(p,0,(1<<r))if(dp[j][p])dp[j+1][p^t[i]]+=dp[j][p];
}
}
vector<int>cnt(m+1,0);
REP(i,0,n+1){
REP(j,0,(1<<r))cnt[i+cntbit(j)]+=dp[i][j];
}
int ans=0;
REP(i,1,m+1)(ans+=cnt[i]*qpow(i,k))%=MOD;
REP(i,0,mr)(ans*=2)%=MOD;
cout<<ans<<endl;
}
void TC() {
int tc=1;
while(tc--){
Main();
cout.flush();
}
}
signed main() {
return cin.tie(0),cout.tie(0),ios::sync_with_stdio(0),TC(),0;
}
/*
1. CLEAR the arrays (ESPECIALLY multitests)
2. DELETE useless output
*/