#include <bits/stdc++.h>

using namespace std;

namespace std {

template <class T1, class T2>
istream& operator>>(istream& is, pair<T1, T2>& p) {
  return is >> p.first >> p.second;
}

template <class... Ts>
istream& operator>>(istream& is, tuple<Ts...>& t) {
  return apply([&is](auto&... xs) -> istream& { return (is >> ... >> xs); }, t);
}

template <class... Ts>
istream& operator>>(istream& is, tuple<Ts&...>&& t) {
  return is >> t;
}

template <class R, enable_if_t<!is_convertible_v<R, string>>* = nullptr>
auto operator>>(istream& is, R&& r) -> decltype(is >> *begin(r)) {
  for (auto&& e : r) {
    is >> e;
  }
  return is;
}

template <class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
  return os << p.first << ' ' << p.second;
}

template <class... Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t) {
  auto f = [&os](const auto&... xs) -> ostream& {
    [[maybe_unused]] auto sep = "";
    ((os << exchange(sep, " ") << xs), ...);
    return os;
  };
  return apply(f, t);
}

template <class R, enable_if_t<!is_convertible_v<R, string_view>>* = nullptr>
auto operator<<(ostream& os, R&& r) -> decltype(os << *begin(r)) {
  auto sep = "";
  for (auto&& e : r) {
    os << exchange(sep, " ") << e;
  }
  return os;
}

}  // namespace std

// end library

namespace std::ranges::views {

namespace {

using ::move;

void solve() {
  int n, m;
  cin >> n >> m;
  vector<uint32_t> a(n);
  cin >> a;
  if (m < n) {
    vector<uint32_t> na(m);
    for (int i : iota(0, m)) {
      for (int j : iota(0, n - m + 1)) {
        if ((j & ~(n - m)) == 0) {
          na[i] += a[i + j];
        }
      }
    }
    a = move(na);
  }
  while (1 < a.size()) {
    vector<uint32_t> na(a.size() - 1);
    for (int i : iota(0, int(na.size()))) {
      na[i] = a[i] + a[i + 1];
      na[i] *= na[i];
    }
    a = move(na);
  }
  cout << (a[0] & ~(-1 << m)) << '\n';
}

}  // namespace

}  // namespace std::ranges::views

using views::solve;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}