#include <bits/stdc++.h>
using namespace std;
// https://space.bilibili.com/672346917

#ifndef LOCAL
#define LOG(...) 42
#endif

#define fi first
#define se second
#define pb push_back
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

typedef long long LL;
typedef pair <int, int> PII;

constexpr LL inf = 1e18;
constexpr double EPS = 1e-8;
const double PI = acos(-1);

int multi_cases = 1;

void A_SOUL_AvA () {
    int n;
    LL H;
    cin >> n >> H;
    vector d(n, vector<LL>(1));
    vector t(n, 0), len(n, 0);
    for (int i = 0; i < n; i++) {
        int m;
        cin >> t[i] >> m;
        len[i] = m;
        for (int j = 0; j < m; j++) {
            int x;
            cin >> x;
            d[i].pb(x);
        }
        for (int j = 1; j < (int)d[i].size(); j++) {
            d[i][j] += d[i][j - 1];
        }
    }

    LL ans = inf;
    vector <LL> f(1 << n, inf);

    for (int S = (1 << n) - 1; S >= 1; S--) {
        vector <pair<int, int>> used;
        int last = 0;
        for (int i = 0; i < n; i++) {
            if (S >> i & 1) {
                used.pb({last, i});
                last += t[i];
            }
        }

        int l = 0, r = 0;
        vector <int> st(n, -1);
        for (auto &[sta, idx] : used) {
            r = max(r, sta + t[idx]);
            st[idx] = sta;
        }
        r += 5;

        auto chk = [&](int mid) -> int {
            LL now = 0;

            for (int i = 0; i < n; i++) if (st[i] != -1) {
                int sta = st[i];
                if (mid < sta) continue;
                if (sta + len[i] - 1 <= mid) {
                    now += d[i].back();
                } else {
                    // mid >= sta && sta + len[i] - 1 > mid
                    int diff = mid - sta + 1;
                    now += d[i][diff];
                }
            }
            return now >= H;
        };
        
        
        while (l < r) {
            int mid = l + r >> 1;

            if (chk(mid)) r = mid;
            else l = mid + 1;
        }

        if (chk(r)) {
            ans = min(ans, 1LL * r);
            // LOG(ans, used);
        }
    }

    cout << (ans == inf ? -1 : ans) << endl;
}

int main () {
    cin.tie(nullptr)->sync_with_stdio(false);
    cout << fixed << setprecision(12);

    int T = 1;
    for (multi_cases && cin >> T; T; T--) {
        A_SOUL_AvA ();
    }

    return 0;
}