#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

const int MAX = 50;

int lucas(int n, int k) {
    if (n < 0 or k < 0 or n < k) return 0;
    return (n & k) == k;
}

void solve() {
    int N, M;
    cin >> N >> M;
    vector<int> A(N);
    cin >> A;
    if (N > MAX) {
        vector<int> nA(MAX);
        for (int i = 0; i < N; i++) {
            A[i] &= 1;
            for (int j = 0; j < MAX; j++) {
                nA[j] += A[i] * lucas(N - MAX, i - j);
            }
        }
        swap(A, nA);
    }
    int base = (1 << M) - 1;
    while (A.size() > 1) {
        vector<int> nA;
        for (int i = 0; i + 1 < int(A.size()); i++) {
            nA.emplace_back((1LL * (A[i] + A[i + 1]) * (A[i] + A[i + 1])) & base);
        }
        swap(A, nA);
    }
    cout << A[0] << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T;
    cin >> T;
    for (; T--;) solve();
    return 0;
}