#include <bits/stdc++.h>
using namespace std;
 
int arr[10];
 
int solve(int n, int k) { 
	if (n == 0)
		return k == 0;
	int ans = 0;
	for (int p = n-1, a = arr[p], q = k-a, r = 0; r < 3; ++r, q += a)
		ans += solve(p,q);
	return ans; }
 
int main() {
	int T; cin.tie(nullptr)->sync_with_stdio(false), cin >> T; 
	for (int N, K; T--; cout << solve(N,K) << endl) {
		cin >> N >> K;
		for (int i = 0; i < N; ++i)
			cin >> arr[i]; }
	return 0; }
 

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgYXJyWzEwXTsKCmludCBzb2x2ZShpbnQgbiwgaW50IGspIHsgCglpZiAobiA9PSAwKQoJCXJldHVybiBrID09IDA7CglpbnQgYW5zID0gMDsKCWZvciAoaW50IHAgPSBuLTEsIGEgPSBhcnJbcF0sIHEgPSBrLWEsIHIgPSAwOyByIDwgMzsgKytyLCBxICs9IGEpCgkJYW5zICs9IHNvbHZlKHAscSk7CglyZXR1cm4gYW5zOyB9CgkKaW50IG1haW4oKSB7CglpbnQgVDsgY2luLnRpZShudWxscHRyKS0+c3luY193aXRoX3N0ZGlvKGZhbHNlKSwgY2luID4+IFQ7IAoJZm9yIChpbnQgTiwgSzsgVC0tOyBjb3V0IDw8IHNvbHZlKE4sSykgPDwgZW5kbCkgewoJCWNpbiA+PiBOID4+IEs7CgkJZm9yIChpbnQgaSA9IDA7IGkgPCBOOyArK2kpCgkJCWNpbiA+PiBhcnJbaV07IH0KCXJldHVybiAwOyB9Cgk=

MQo0IDIKMSAzIDIgNg==

1
4 2
1 3 2 6