#include <bits/stdc++.h>
#define int long long
using namespace std;
inline int read()
{
	int n=0,f=1,ch=getchar();
	while(ch<'0'||ch>'9')
	{
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
	{
		n=n*10+ch-'0';
		ch=getchar();
	}
	return n*f;
}
int lq[105],len[105];
vector<int>d[105];
int dp[1000005];
int zh[1000005];
signed main()
{
	int t,n,h,l,r,mid,x;
	t=read();
	for(int greg=1;greg<=t;greg++)
	{
		n=read();
		h=read();
		l=1;
		r=1000000000;
		for(int i=1;i<=n;i++)
		{
			lq[i]=read();
			len[i]=read();
			d[i].clear();
			x=0;
			for(int j=0;j<len[i];j++)
			{
				x+=read();
				d[i].push_back(x);
			}
		}
		for(int i=1;i<(1<<n);i++)
		{
			for(int j=1;j<=n;j++)
			{
				if(i&(1<<(j-1)))
				{
					zh[i]=zh[i-(1<<(j-1))]+lq[i];
				}
			}
		}
		while(l<=r)
		{
			mid=(l+r)>>1;
			dp[0]=0;
			for(int i=1;i<(1<<n);i++)
			{
				dp[i]=0;
				for(int j=1;j<=n;j++)
				{
					if((i&(1<<(j-1)))==0)continue;
					if(mid-zh[i-(1<<(j-1))]>=0)dp[i]=max(dp[i],dp[i-(1<<(j-1))]+d[j][min(mid-zh[i-(1<<(j-1))],len[j]-1)]);
					else dp[i]=max(dp[i],dp[i-(1<<j-1)]);
				}
			}
			//printf("%lld %lld\n",mid,dp[(1<<n)-1]);
			if(dp[(1<<n)-1]>=h)r=mid-1;
			else l=mid+1;
		}
		if(l>1000000000)printf("-1\n");
		else printf("%lld\n",l);
	}
	return 0;
}