#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
constexpr int maxn = 45;
constexpr int maxm = 18;
constexpr int mod = 1000000000 + 7;
i64 qp(i64 a, i64 b)
{
    i64 c = 1;
    for (; b; b>>=1, a=a*a%mod)
        if (b & 1) c=c*a%mod;
    return c;
}
i64 a[maxn], p[maxn];
i64 f[1 << maxm][maxn], g[1 << maxm][maxn];
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n, k;
    cin >> n >> k;
    for (int i=0;i<n;++i)
    {
        i64 x;
        cin >> x;
        for (int j=n-1;j>=0;--j)
            if (x >> j & 1)
            {
                if (!a[j]) a[j] = x;
                x ^= a[j];
            }
    }
    for (int i=n-1;i;--i)
        for (int j=i-1;j>=0;--j)
            if ((a[i] >> j & 1) && a[j]) a[i] ^= a[j];
    for (int i=0;i<=n;++i) p[i] = qp(i, k);
    vector<int> u, v;
    for (int i=0;i<n;++i) (a[i] ? u : v).emplace_back(i);
    i64 ans = 0;
    if (v.size() > 18)
    {
        for (int i=0;i<(1<<u.size());++i)
        {
            i64 x = 0;
            for (int j=0;j<u.size();++j) if (i >> j & 1) x ^= a[u[j]];
            ans += p[__builtin_popcount(x)];
        }
        cout << ((ans % mod) << n - u.size()) % mod << '\n';
        return 0;
    }
    int m = v.size();
    f[0][0] = 1;
    for (int i=0;i<u.size();++i)
    {
        memcpy(g, f, sizeof(f));
        i64 s = 0;
        for (int j=0;j<m;++j) if (a[u[i]] >> v[j] & 1) s |= 1 << j;
        for (int x=0;x<(1<<m);++x)
            for (int y=0;y<=i;++y)
                (f[x ^ s][y + 1] += g[x][y]) %= mod;
    }
    for (int x=0;x<(1<<m);++x)
        for (int y=0;y<=u.size();++y)
            (ans += p[__builtin_popcount(x) + y] * f[x][y]) %= mod;
    cout << ((ans % mod) << n - u.size()) % mod << '\n';
    return 0;
}