#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1 << 18;
const int M = 3e6;
const int Q = 1e5 + 20;
int T, n;
ll H, sum[20][Q];
bool dp[N];
int t[Q], len[Q];
vector<ll> node[20];

bool cmp(int x, int y){
    return len[x] - t[x] > len[y] - t[y];
}

bool findans(int x, int y, ll mid){
    ll res = 0;
    vector<int> id;
    int qwe = 1;
    while(x){
        if(x & 1){
            id.push_back(qwe);
            res += sum[qwe][0];
        }
        x >>= 1;
        qwe++;
    }
    sort(id.begin(), id.end(), cmp);
    int l = 0, r = 0;
    for(auto it: id){
        r = max(r, l + len[it]);
        l += t[it];
    }
    int asd = min((ll)node[y].size() - 1, mid - l);
    res += sum[y][asd];
    return res >= H;
}

bool findlen(int x, ll mid){
    vector<int> id;
    int qwe = 1;
    while(x){
        if(x & 1) id.push_back(qwe);
        x >>= 1;
        qwe++;
    }
    sort(id.begin(), id.end(), cmp);
    int l = 0, r = 0;
    for(auto it: id){
        r = max(r, l + len[it]);
        l += t[it];
    }
    return r <= mid;
}

bool check(int mid){
    for(int i = 0; i < 1 << n; i++){
        dp[i] = false;
    }
    dp[0] = true;
    for(int i = 1; i < 1 << n; i++){
        for(int j = 0; j < n; j++){
            if(i >> j & 1){
                int res = i ^ (1 << j);
                if(!dp[res]) continue;
                if(findans(res, j + 1, mid)) return true;
                if(findlen(i, mid)) dp[i] = true;
            }
        }
    }
    return false;
}

int main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	cin >> T;
	while(T--){
		cin >> n >> H;
        for(int i = 1; i <= n; i++){
            node[i].clear();
            sum[i][0] = sum[i][1] = 0;
            cin >> t[i] >> len[i];
            for(int j = 1; j <= len[i]; j++){
                ll x;
                cin >> x;
                node[i].push_back(x);
                sum[i][0] += x;
                if(j == 1) sum[i][1] = x;
                else sum[i][j] = sum[i][j - 1] + x;
            }
        }
        int ans = -1;
        int l = 1, r = M;
        while(l <= r){
            int mid = (l + r) / 2;
            if(check(mid)){
                ans = mid;
                r = mid - 1;
            }
            else l = mid + 1;
        }
        if(ans != - 1) ans --;
        cout << ans << endl;
	}
	return 0;
}