#include<iostream>
using namespace std;
#define ll long long


const int MAXN = 3e5 + 10, MAXM = 1e5 + 10;
ll dp[MAXN];


int T, n, edsta;
int t[20], tim[MAXN];
ll len[20][MAXM];
ll H;

void init() {
	for (int i = 0; i <= edsta; i++) {
		for (int j = 1; j <= n; j++) {
			if ((i >> (j - 1)) & 1) {
				tim[i] += t[j];
			}
		}
		// tim[i] -= 1;
	}
}

bool Check(int mid) {
	ll MAX = 0;
	for (int i = 0; i <= edsta; i++) 
		dp[i] = 0;
	for (int i = 0; i <= edsta; i++) {
		if (tim[i] > mid) continue;
		for (int j = 1; j <= n; j++) {
			if ((i >> (j - 1)) & 1) continue;
			int nx = i | (1 << (j - 1));
			int r = min(len[j][0], (ll)mid - tim[i] + 1);
			dp[nx] = max(dp[nx], dp[i] + len[j][r]);
			MAX = max(MAX, dp[nx]);
			// if ((i >> (j - 1)) & 1) {
			// 	int lst = i ^ (1 << (j - 1));
			// 	// printf("asd%d %d\n", tim[lst], mid);
			// 	if (tim[lst] >= mid) continue;
			// 	int r = min((ll)mid - tim[lst], len[j][0]); //time
			// 	// printf("%d %lld\n", j, len[j][r]);
			// 	dp[i] = max(dp[lst] + len[j][r], dp[i]);
				// printf("%d %lld\n", nx, dp[nx]);
			// 	MAX = max(MAX, dp[i]);
			// }
		}
	}
	// printf("%lld %d", MAX, mid);
	return MAX >= H ? 0 : 1;
}

int main() {
	scanf("%d", &T);
	while (T--) {
		scanf("%d%lld", &n, &H);
		edsta = (1 << n) - 1;
		for (int i = 1; i <= n; i++) {
			scanf("%d%lld", &t[i], &len[i][0]);
			for (int j = 1; j <= len[i][0]; j++) 
				scanf("%lld", &len[i][j]);
			for (int j = 2; j <= len[i][0]; j++) 
				len[i][j] += len[i][j - 1];
		}
		init();
		int l = 0, r = 2e6 + 10;
		while (l < r) {
			int mid = l + r >> 1;
			if (Check(mid)) l = mid + 1;
			else r = mid;
			// printf("%d %d\n", l, r);
		}
		if (l == 2e6 + 10) l = -1;
		printf("%d\n", l);
	}
	return 0;
}