// Go in my style.
// Not afraid to dark.

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

clock_t sttime;
#define STCLOCK sttime = clock ();
#define TIMENOW fprintf (stderr, "\nNOW TIME COSSEMED: %0.4lf\n", 1.0 * (clock () - sttime) / CLOCKS_PER_SEC);
#define inline __inline__ __attribute__ ((always_inline))

#define int long long

namespace io {
    int read_pos, read_dt; char read_char;
    inline int read (int &p = read_pos){
        p = 0, read_dt = 1; read_char = getchar ();
        while (! isdigit (read_char)){
            if (read_char == '-')
                read_dt = - 1;
            read_char = getchar ();
        }
        while (isdigit (read_char)){
            p = (p << 1) + (p << 3) + read_char - 48;
            read_char = getchar ();
        }
        return p = p * read_dt;
    }
    int write_sta[65], write_top;
    inline void write (int x){
        if (x < 0)
            putchar ('-'), x = - x;
        write_top = 0;
        do
            write_sta[write_top ++] = x % 10, x /= 10;
        while (x);
        while (write_top)
            putchar (write_sta[-- write_top] + 48);
    }
}

#define ful(t) ((1ll << (t)) - 1)
const int N = 44, mod = 1e9 + 7;
int n, m, ts[N + 5], cnt;

struct LINE {
    int b[N + 5];
    inline bool insert (int x){
        for (int i = N;i >= 0;-- i)
            if (x >> i & 1){
                if (b[i]) x ^= b[i];
                else {
                    b[i] = x;
                    return true;
                }
            }
        return false;
    }
    inline void sol (){
        map < pair < int , int > , int > f, g;
        f[make_pair (0, 0)] = 1;
        auto upd = [&] (int i, pair < int , int > t, int w){
            auto r = t;
            t.first ^= w;
            g[make_pair (t.first & ful (i), t.second + (t.first >> i & 1))] += f[r];
        };
        for (int i = N;i >= 0;-- i){
            if (b[i])
                for (auto x : f) upd (i, x.first, 0), upd (i, x.first, b[i]);
            else for (auto x : f) upd (i, x.first, 0);
            f.clear (); swap (f, g);
        }
        for (auto x : f) ts[x.first.second] += x.second;
    }
} l;

inline int power (int a, int p){
    static int res; res = 1;
    while (p > 0){
        if (p & 1) res = res * a % mod;
        a = a * a % mod;
        p >>= 1;
    }
    return res;
}

signed main (){
    STCLOCK

    io::read (n), io::read (m);
    for (int i = 1;i <= n;++ i) cnt += ! l.insert (io::read ());
    l.sol ();
    int ans = 0;
    for (int i = 1;i <= N;++ i) ans = (ans + ts[i] % mod * power (i, m)) % mod;
    ans = ans * power (2, cnt) % mod;
    io::write (ans), putchar ('\n');

    TIMENOW
    return 0;
}