#include<bits/stdc++.h>

using namespace std;
typedef long long ll;

const ll N = 20 + 5, S = (1 << 20) + 5, Inf = 0x3f3f3f3f3f3f3f3f;

class node{
public:
	ll x, y;
	inline node() {}
	inline node(ll x_, ll y_){
		x = x_, y = y_;
	}
};

inline ll sqr(ll x){
	return x * x;
}

ll n = 0, m = 0, A = 0, B = 0, w[N] = {}, sum[S] = {}, dp[N][S] = {};
vector<ll> sub[S] = {};
ll siz = 0, cur = 0;
node convex[S] = {};

inline bool cmp(ll x, ll y){
	return sum[x] > sum[y];
}

inline bool check(node a, node b, node c){
	return (b.y - a.y) * (c.x - b.x) >= (c.y - b.y) * (b.x - a.x);
}

inline void work(ll x, ll y){
	if(siz && x == convex[siz].x){
		convex[siz].y = min(convex[siz].y, y);
		return;
	}
	while(siz > 1 && check(convex[siz - 1], convex[siz], node(x, y))) siz --;
	convex[++ siz] = node(x, y); 
}

inline void init(){
	n = m = A = B = 0;
	memset(w, 0, sizeof(w)), memset(sum, 0, sizeof(sum));
	for(ll x = 0 ; x < S ; x ++) sub[x].clear();
	memset(dp, 0x3f, sizeof(dp));
	dp[0][0] = 0;
}

inline void solve(){
	scanf("%lld %lld", &n, &m); A = (1 << (n / 2)) - 1, B = (1 << n) - (1 << (n / 2));
	for(ll i = 0 ; i < n ; i ++) scanf("%lld", &w[i]);
	for(ll x = 0 ; x < (1 << n) ; x ++) if((x & A) == x || (x & B) == x){
		for(ll i = 0 ; i < n ; i ++) if((x >> i) & 1) sum[x] += w[i];
		for(ll y = x ; ; y = x & (y - 1)){
			sub[x].push_back(y);
			if(!y) break;
		}
		sort(sub[x].begin(), sub[x].end(), cmp);
	}
	for(ll i = 1 ; i <= m ; i ++) for(ll s : sub[A]) for(ll T : sub[B]){
		siz = 0, cur = 1;
		for(ll t : sub[T]) if(dp[i - 1][s + t] < Inf) work(sum[T - t], dp[i - 1][s + t] + sqr(sum[T - t]));
		if(siz) for(ll x : sub[A - s]){
			ll S = s + x;
			while(cur < siz && 2 * sum[x] * convex[cur].x + convex[cur].y > 2 * sum[x] * convex[cur + 1].x + convex[cur + 1].y) cur ++;
			dp[i][S + T] = min(dp[i][S + T], sqr(sum[x]) + 2 * sum[x] * convex[cur].x + convex[cur].y);
		}
	}
	for(ll i = 1 ; i <= m ; i ++){
		ll ans = 0;
		for(ll x = 1 ; x < (1 << n) ; x ++) ans += dp[i][x];
		printf("%lld\n", ans);
	}
}

ll T = 0;

int main(){
	scanf("%lld", &T);
	for(ll i = 0 ; i < T ; i ++) init(), solve();
	return 0;
}