#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int mod = 1'000'000'007;

int add(int a, int b)
{
	return a + b < mod ? a + b : a + b - mod;
}
int sub(int a, int b)
{
	return a - b >= 0 ? a - b : a - b + mod;
}
int mult(int a, int b)
{
	return (LL)a * b % mod;
}
int binpow(int a, int p)
{
	int ans = 1;
	while (p)
	{
		if (p & 1) ans = mult(ans, a);
		a = mult(a, a);
		p /= 2;
	}
	return ans;
}
int inv(int a)
{
	return binpow(a, mod - 2);
}

void convXor(VI& a, int k)
{
	FOR(i, 0, k)
		FOR(j, 0, 1 << k)
			if((j & (1 << i)) == 0)
			{
				int u = a[j];
				int v = a[j + (1 << i)];
				a[j] = add(u, v);
				a[j + (1 << i)] = sub(u, v);
			}
}

const int MAX = 44;
const int MAXR = 19;
const int MAXL = 24;

VI cnt[2];

void f(int t, vector<LL> b)
{
	int n = SZ(b);
	FOR (mask, 0, 1 << n)
	{
		LL x = 0;
		FOR (j, 0, n)
		{
			if (mask & (1 << j))
				x ^= b[j];
		}
		int num = __builtin_popcountll(x >> MAXR);
		LL msk = x & ((1 << MAXR) - 1);
		msk += num << MAXR;
		cnt[t][msk]++;
	}
}


int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	cout << fixed << setprecision(15);
	
	int n, k;
	cin >> n >> k;
	vector<LL> a(n);
	FOR (i, 0, n)
	{
		cin >> a[i];
	}
	vector<LL> basis;
	FOR (i, 0, n)
	{
		FOR (j, 0, SZ(basis))
		{
			if ((a[i] ^ basis[j]) < a[i])
				a[i] ^= basis[j];
		}
		if (a[i] != 0)
			basis.PB(a[i]);
		sort(ALL(basis), greater());
	}
	
	vector<LL> b[2];
	FOR (i, 0, SZ(basis))
	{
		int idx = basis[i] >= (1 << (MAXR));
		b[idx].PB(basis[i]);
	}
	FOR (t, 0, 2)
	{
		cnt[t].resize(1 << MAXL);
		f(t, b[t]);
	}
	
	
	int ans = 0;
	int two = 2;
	two = binpow(two, n - SZ(basis));
	
	
	VI res(MAX + 1);
	
	convXor(cnt[0], MAXL);
	convXor(cnt[1], MAXL);
	FOR(j, 0, 1 << MAXL)
		cnt[1][j] = mult(cnt[1][j], cnt[0][j]);
	convXor(cnt[1], MAXL);
			
	FOR (j, 0, 1 << MAXL)
	{
		int i = j >> MAXR;
		int x = i + __builtin_popcount(j - (i << MAXR));
		res[x] = add(res[x], cnt[1][j]);
	}
	
	FOR(x, 0, MAX + 1)
	{
		int coef = mult(res[x], inv(1 << MAXL));
		coef = mult(coef, binpow(x, k));
		coef = mult(coef, two); 
		ans = add(ans, coef);

	}
	
	cerr << db(clock()) / CLOCKS_PER_SEC << '\n';
	cout << ans << '\n';
	
	
	
	
	
	return 0;
}