토렌트

#include <bits/stdc++.h>

#define MAX_N 101
#define ll long long
#define all(a) begin(a), end(a)
using namespace std;

ll n, m;
ll match[MAX_N], seen[MAX_N], a[MAX_N];
unordered_set<ll> d[MAX_N];

ll dfs(ll u, ll s) {
    for(auto& v : d[u]) {
        if(seen[v] == s) continue;
        seen[v] = s;
        if(match[v] == -1 or dfs(match[v], s)) {
            match[v] = u;
            return 1;
        }
    }
    return 0;
}
ll solve() {
    for(ll i = 0, ma = 0; i < MAX_N; i++) {
        if(dfs(i, i))
            ma++;
        if(ma == n)
            return i + 1;
    }

    return -1;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll tc;
    cin>>tc;
    while(tc--) {
        for(ll i = 0; i < MAX_N; i++) d[i].clear();
        cin>>n>>m;
        ll f, e, seed;

        while(m--) {
            cin>>f>>e>>seed;
            for(ll i = 0; i < seed; i++) cin>>a[i];
            for(ll i = f; i < e; i++)
                for(ll j = 0; j < seed; j++)
                    d[i].insert(a[j]);
        }

        memset(match, -1, sizeof(match));
        memset(seen, -1, sizeof(seen));
        cout<<solve()<<'\n';
    }
    return 0;
}