#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

int naive(vector<int> a, int m){
    int n = a.size();
    for(int i = 0; i < n-1; i++){
        vector<int> b(a.size()-1);
        for(int j = 0; j+1 < a.size(); j++){
            ll sum = a[j]+a[j+1];
            b[j] = (sum*sum)%(1<<m);
        }
        a = b;
    }
    return a[0];
}

vector<int> add(vector<int> a, vector<int> b){
    int n = a.size();
    vector<int> ans(n);
    for(int i = 0; i < n; i++) ans[i] = a[i]+b[i];
    return ans;
}

void calc(int n, int m){
    map<vector<int>, ll> mp;
    mp[{1}] = 1;
    for(int i = 0; i < n; i++){
        map<vector<int>, ll> nx;
        auto add_mp = [&](vector<int> ww, ll s){
            if(nx.count(ww)) {
                nx[ww] += s%(1<<m);
                nx[ww] %=(1<<m);
            }else{
                nx[ww] = s%(1<<m);
                nx[ww] %=(1<<m);
            }
        };
        for(auto [v, x]: mp){
            for(auto [u, y]: mp){
                auto vv = v; vv.push_back(0);
                vector<int> uu = {0};
                for(int a: u) uu.push_back(a);
                auto ww = add(uu, vv);
                add_mp(ww, x*y*2);
            }
            for(auto [u, y]: mp){
                auto vv = v; vv.push_back(0);
                auto uu = u; uu.push_back(0);
                auto ww = add(uu, vv);
                add_mp(ww, x*y);
            }
            for(auto [u, y]: mp){
                vector<int> vv = {0};
                for(int a: v) vv.push_back(a);
                vector<int> uu = {0};
                for(int a: u) uu.push_back(a);
                auto ww = add(uu, vv);
                add_mp(ww, x*y);
            }
        }
        mp.clear();
        for(auto [v, x]: nx){
            if(x == 0) continue;
            mp[v] = x;
        }
    }
    for(auto [u, x]: mp){
        for(int y: u) cout << y << ' ';
        cout << ":" << x << endl;
    }
}

void test(int n, int m){
    for(int s = 0; s < (1<<n); s++){
        vector<int> a(n);
        for(int i = 0; i < n; i++){
            if(s&(1<<i)) a[i] = 1;
        }
        cout << "=====" << endl;
        print_vector(a);
        naive(a, m);
    }
}

// https://algo-logic.info/is-nck-odd-even/
bool is_nCk_odd(int n, int k){
    return (n&k)==k;
}

void solve(){
    int n, m; cin >> n >> m;
    vector<int> a(n);
    for(int i = 0; i < n; i++) {
        cin >> a[i];
    }
    int M = 31;
    if(n <= 31){
        cout << naive(a, m) << endl;
        return;
    }
    vector<int> b(31);
    int len = n-31;
    for(int l = 0; l < 31; l++){
        for(int i = l; i <= l+len; i++){
            if(a[i]%2 == 0) continue;
            if(is_nCk_odd(len, i-l)) b[l] ^= 1;
        }
    }
    cout << naive(a, m) << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int t; cin >> t;
    while(t--) solve();
}