#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

LL MOD;
LL ex(LL x, LL y, LL mod = MOD) {
	LL z[64], v = 1;
	inc(i, 64) { z[i] = (i == 0 ? x : z[i - 1] * z[i - 1] % mod); }
	inc(i, 64) { if((y >> i) & 1) { (v *= z[i]) %= mod; } }
	return v;
}

LL n, k, a[100000];

int main() {
	MOD = 1e9 + 7;
	cin >> n >> k;
	inc(i, n) { cin >> a[i]; }
	
	assert(k <= 24); // わからん
	
	LL m = n;
	(m *= ex(2, k) - 1) %= MOD;
	(m *= ex(2, k - 1)) %= MOD;
	cout << m << endl;
	
	LL s = 0;
	inc(x, 1LL << k) {
		LL sum = 0;
		inc(i, n) { (sum += (a[i] ^ x)) %= MOD; }
		(s += sum * sum % MOD) %= MOD;
		// cout << sum << ": "; inc(i, n) { cout << (a[i] ^ x) << " "; } cout << endl;
	}
	
	LL ans = (ex(2, k) * s % MOD + (MOD - m * m % MOD)) % MOD;
	cout << ans << endl;
	
	return 0;
}