#include<bits/stdc++.h>
#define rep(i, a, b) for(int i = (a); i < (b); i++) 
#define _for(i, a, b) for(int i = (a); i <= (b); i++) 
using namespace std;

typedef long long ll;
const int N = 20;
int t[N], len[N], n;
ll k[1 << 18], dp[1 << 18];
vector<ll> s[N]; 
ll H, sum;

bool check(int key)
{
	memset(dp, 0, sizeof dp);
	rep(S, 0, 1 << n)
		rep(i, 0, n)
			if(S & (1 << i))
			{
				int temp = max(key - k[S ^ (1 << i)], 0ll);
				dp[S] = max(dp[S], dp[S ^ (1 << i)] + s[i + 1][min(temp, len[i + 1])]);
				if(dp[S] >= H) return true;
			}
	return false;
}

int main()
{
	int T; scanf("%d", &T);
	while(T--)
	{
		scanf("%d%lld", &n, &H);
		_for(i, 1, n) s[i].clear();
		sum = 0;
		_for(i, 1, n)
		{
			scanf("%d%d", &t[i], &len[i]);
			s[i].push_back(0);
			_for(j, 1, len[i])
			{
				int x; scanf("%d", &x);
				s[i].push_back(x + s[i].back());
				sum += x;
			}
		}

		if(sum < H)
		{
			puts("-1");
			continue;
		}

		rep(S, 0, 1 << n)
		{
			k[S] = 0;
			rep(i, 0, n)
				if(S & (1 << i))
					k[S] += t[i + 1] + 1;
			k[S]--;
		}

		int l = -1, r = 3e6;
		while(l + 1 < r)
		{
			int m = l + r >> 1;
			if(check(m)) r = m;
			else l = m;
		}
		printf("%d\n", r);
	}
	
	return 0;
}