#include <bits/stdc++.h>
#define ll long long
using namespace std;

const int N = 19;
const int MOD = 998244353;

ll H, dp[1 << N], sum[1 << N];
int T, n, t[N], len[N];
vector<ll> d[N];

bool check (int x) {
    for (int i = 0; i < (1 << n); i ++) dp[i] = -1;
    dp[0] = 0;
    ll ans = 0;
    for (int i = 0; i < (1 << n); i ++) {
        ans = max (dp[i], ans);
        if (sum[i] > x) continue;
        if (dp[i] == -1) continue;
        for (int j = 0; j < n; j ++) {
            if ((i >> j & 1) == 0) {
                if (sum[i] + len[j] - 1 <= x) dp[i | (1 << j)] = max (dp[i] + d[j][len[j]], dp[i | (1 << j)]);
                else dp[i | (1 << j)] = max (dp[i] + d[j][x - sum[i] + 1], dp[i | (1 << j)]);
            }
        }
    }
    return ans >= H;
}

int main () {
    freopen ("in.in", "r", stdin);
    freopen ("out.out", "w", stdout);

    scanf ("%d", &T);
    while (T --) {
        scanf ("%d%lld", &n, &H);
        for (int i = 0; i < n; i ++) {
            scanf ("%d%d", &t[i], &len[i]);
            d[i] = vector<ll> (len[i] + 1, 0);
            for (int j = 1; j <= len[i]; j ++) {
                scanf ("%lld", &d[i][j]);
                d[i][j] += d[i][j - 1];
            }
        }
        for (int i = 0; i < (1 << n); i ++) {
            sum[i] = 0;
            for (int j = 0; j < n; j ++) {
                if (i >> j & 1) {
                    sum[i] += t[j];
                }
            }
        }
        int l = 1, r = 3e6, ans = -1;
        while (l <= r) {
            int mid = (l + r) >> 1;
            if (check (mid)) ans = mid, r = mid - 1;
            else l = mid + 1;
        }
        printf("%d\n", ans);
    }

    return 0;
}