#include<iostream>
#include <bits/stdc++.h>

#define ld long double
#define ll long long
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int N = 30, inf = 2e9;

void doWork() {
    int n, c;
    cin >> n >> c;
    map<int, vector<int> > pos;
    while (n--) {
        int x, t;
        cin >> x >> t;
        while (t--) {
            int a;
            cin >> a;
            pos[a].push_back(x);
        }
    }
    vector<pair<int, int> > seg;
    for (auto i: pos) {
        vector<int> &v = i.second;
        sort(v.begin(), v.end());
        int prv = -inf;
        for (auto i: v) {
            seg.push_back({prv, i});
            prv = i;
        }
        seg.push_back({prv, inf});
    }

    sort(seg.rbegin(), seg.rend());

    vector<int> good_points;
    for (auto i: seg) {
        good_points.push_back(i.first);
        good_points.push_back(i.second);
    }
    sort(good_points.begin(), good_points.end());
    good_points.resize(unique(good_points.begin(), good_points.end()) - good_points.begin());
    good_points.pop_back();
    good_points.erase(good_points.begin());

    ll sum_LR = 0, sum_L = 0, cnt = 0;

    multiset<ll> q1; // for L+R >= 2I
    priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>> q2; // curSegments R , L

    auto add_seg = [&](ll l, ll r) {
        sum_L += l;
        q1.insert(l + r);
        q2.push({r, l});
    };

    auto del_seg = [&](ll i) {
        ll l = q2.top().second, r = q2.top().first;
        q2.pop();
        sum_L -= l;
        if (l + r < 2 * i) {
            sum_LR -= l + r;
            cnt--;
        } else {
            q1.erase(q1.find(l + r));
        }
    };

    ll ans = 1e18;

    for (auto i: good_points) {

        while (!seg.empty() && seg.back().first < i) {
            add_seg(seg.back().first, seg.back().second);
            seg.pop_back();
        }

        while (!q1.empty() && *q1.begin() < 2 * i) {
            sum_LR += *q1.begin();
            cnt++;
            q1.erase(q1.begin());
        }

        while (!q2.empty() && q2.top().first <= i) {
            del_seg(i);
        }

        int n = q2.size();
        ans = min(ans, sum_LR + (n - 2 * cnt) * i - sum_L);
    }
    cout << ans << "\n";
}

int main() {
    IO
    int t = 1;
    cin >> t;
    for (int i = 1; i <= t; i++) {
        //  cout << "Case #" << i << ": ";
        doWork();
    }
}