#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
using ll=long long;

const int N=1e5+5;
ll pre[20][N];
int t[20],len[20];
int n;
ll cal(int T){
	vector<ll>dp(1<<n,-1);
	dp[0]=0;
	ll res=0;
	for(int S=1;S<1<<n;++S){
		int tot=0;
		for(int i=0;i<n;++i){
			if(S>>i&1)tot+=t[i];
		}
		for(int i=0;i<n;++i){
			if(S>>i&1){
				int la=S^(1<<i);
				if(dp[la]==-1)continue;
				int til=min(len[i]-1,T-(tot-t[i]));
				dp[S]=max(dp[S],dp[la]+pre[i][til]);
			}
		}
		res=max(res,dp[S]);
	}
	return res;
}
signed main() {
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int T;cin>>T;
	for(;T;T--){
		cin>>n;
		ll h;cin>>h;
		for(int i=0;i<n;++i){
			cin>>t[i]>>len[i];
			for(int j=0;j<len[i];++j){
				cin>>pre[i][j];
				if(j)pre[i][j]+=pre[i][j-1];
			}
		}
		int l=0,r=2e6,ans=-1;
		for(;l<=r;){
			int m=(l+r)>>1;
			if(cal(m)>=h)r=m-1,ans=m;
			else l=m+1;
		}
		cout<<ans<<endl;
	}
	return 0;
}
// init?
// var->0?
// infinite dfs?
// out of bound?
// max_element / min_element?