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

int lucas(int n,int k) {
    for(int i = 0; i < 20; i++) {
        int a = 1 & (n >> i);
        int b = 1 & (k >> i);
        if(a < b) return 0;
    }
    return 1;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    while(t--) {
        int n,m;
        cin >> n >> m;
        vector<int>a(n);
        for(int i = 0; i < n; i++) {
            cin >> a[i];
        }
        if(n-m < 0) {
            while(a.size() > 1) {
                vector<int>b;
                for(int i = 0; i+1 < a.size(); i++) {
                    b.push_back(1ll*(a[i]+a[i+1])*(a[i]+a[i+1])%(1 << m));
                }
                a = b;
            }
            cout << a[0] << "\n";
        }
        else {
            for(int i = 0; i < n; i++) a[i] %= 2;
            vector<int>b;
            int tmp = n-m;
            for(int i = 0; i+tmp < n; i++) {
                int sum = 0;
                for(int j = 0; j <= tmp; j++) {
                    sum ^= lucas(tmp,j)*a[i+j];
                }
                b.push_back(sum);
            }
            while(b.size() > 1) {
                vector<int>c;
                for(int i = 0; i+1 < b.size(); i++) {
                    c.push_back(1ll*(b[i]+b[i+1])*(b[i]+b[i+1])%(1 << m));
                }
                b = c;
            }
            cout << b[0] << "\n";
        }
    }
}