时间90%

#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
vector<int> v[N];
int a[N];
int in[N];
int t,n,k,x;
void solve() {
    queue<int> q;
    for(int i=1;i<=n;i++)if (!in[i])q.push(i);
    int cnt = 0;
    while(!q.empty()) {
        cnt++;
        int cur = q.front();
        q.pop();
        for(int i:v[cur]) {
            if (!(--in[i]))q.push(i);
        }
    }
    if (cnt == n) {
        cout << "YES" << endl;
    }else {
        cout << "NO" << endl;
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin >> t;
    while(t--) {
        cin >> n >> k;
        for(int i=1;i<=n;i++){
            in[i] = 0;
            v[i].clear();
        }
        for(int i=0;i<k;i++) {
            for(int j=0;j<n;j++) cin >> a[j];
            for(int j=1;j+1<n;j++) {
                v[a[j]].push_back(a[j+1]);
                in[a[j+1]]++;
            }
        }
        solve();
    }
    return 0;
}