#include <bits/stdc++.h>
#define _rep(i, x, y) for(int i = x; i <= y; ++i)
#define _req(i, x, y) for(int i = x; i >= y; --i)
#define _rev(i, u) for(int i = head[u]; i; i = e[i].nxt)
#define pb push_back
#define fi first
#define se second
#define mst(f, i) memset(f, i, sizeof f)
using namespace std;
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
typedef long long ll;
typedef pair<int, int> PII;
namespace fastio{
    #ifdef ONLINE_JUDGE
    char ibuf[1 << 20],*p1 = ibuf, *p2 = ibuf;
    #define get() p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++
    #else
    #define get() getchar()
    #endif
    template<typename T> inline void read(T &t){
        T x = 0, f = 1;
        char c = getchar();
        while(!isdigit(c)){
            if(c == '-') f = -f;
            c = getchar();
        }
        while(isdigit(c)) x = x * 10 + c - '0', c = getchar();
        t = x * f;
    }
    template<typename T, typename ... Args> inline void read(T &t, Args&... args){
        read(t);
        read(args...);
    }
    template<typename T> void write(T t){
        if(t < 0) putchar('-'), t = -t;
        if(t >= 10) write(t / 10);
        putchar(t % 10 + '0');
    }
    template<typename T, typename ... Args> void write(T t, Args... args){
        write(t), putchar(' '), write(args...);
    }
    template<typename T> void writeln(T t){
        write(t);
        puts("");
    }
    template<typename T> void writes(T t){
        write(t), putchar(' ');
    }
    #undef get
};
using namespace fastio;
#define multitest() int T; read(T); _rep(tCase, 1, T)
namespace Calculation{
    const ll mod = 998244353;
    ll ksm(ll p, ll h){ll base = p % mod, res = 1; while(h){if(h & 1ll) res = res * base % mod; base = base * base % mod, h >>= 1ll;} return res;}
    void dec(ll &x, ll y){x = ((x - y) % mod + mod) % mod;}
    void add(ll &x, ll y){x = (x + y) % mod;}
    void mul(ll &x, ll y){x = x * y % mod;}
    ll sub(ll x, ll y){return ((x - y) % mod + mod) % mod;}
    ll pls(ll x, ll y){return ((x + y) % mod + mod) % mod;}
    ll mult(ll x, ll y){return x * y % mod;}
}
using namespace Calculation;
const int N = 2e5 + 5;
int n, m, len, lsh[N];
vector<int> a[N], pos[N];

int main(){
    multitest(){
        read(n, m);
        _rep(i, 1, n){
            a[i].resize(m + 2);
            _rep(j, 1, m){
                read(a[i][j]);
                lsh[++len] = a[i][j];
            }
        }
        sort(lsh + 1, lsh + 1 + len), len = unique(lsh + 1, lsh + 1 + len) - lsh - 1;
        _rep(i, 1, n) _rep(j, 1, m) a[i][j] = lower_bound(lsh + 1, lsh + 1 + len, a[i][j]) - lsh;
        _rep(i, 1, n) _rep(j, 1, m) pos[a[i][j]].pb(j);
        multiset<int> st;
        for(auto &i : pos[len]) st.insert(i);
        int ans = 0;
        _req(i, len - 1, 1){
            sort(pos[i].begin(), pos[i].end());
            vector<int> cur;
            for(auto it = prev(pos[i].end()); ; it = prev(it)){
                auto t = st.lower_bound(*it);
                if(t == st.begin()){
                    cur.pb(*it);
                    if(it == pos[i].begin()) break;
                    continue;
                }
                // debug("u:%d v:%d\n", (*prev(t)), (*it));
                st.erase(prev(t)), ans++;
                if(it == pos[i].begin()) break;
            }
            for(auto &j : cur) st.insert(j);
        }
        _rep(i, 1, n) a[i].clear();
        _rep(i, 1, len) pos[i].clear();
        puts(ans >= n ? "YES" : "NO");
        len = 0;
    }
    return 0;
}