#include <bits/stdc++.h>

#define forn(i, n) for (int i = 0; i < int(n); ++i)
#define fore(i, l, r) for (int i = int(l); i < int(r); ++i)
#define sz(a) (int)((a).size())

using namespace std;

typedef long long li;

void solve(){
	int n, m;
	cin >> n >> m;
	vector<vector<int>> a(n, vector<int>(m));
	forn(i, n) forn(j, m) cin >> a[i][j];
	vector<pair<int, int>> ord(n * m);
	forn(i, n) forn(j, m) ord[i * m + j] = {i, j};
	sort(ord.begin(), ord.end(), [&](const pair<int, int> &x, const pair<int, int> &y){
		if (a[x.first][x.second] != a[y.first][y.second])
			return a[x.first][x.second] > a[y.first][y.second];
		return x.second < y.second;
	});
	multiset<int> cur;
	int cnt = 0;
	forn(i, n * m){
		int j = i - 1;
		vector<int> add;
		while (j + 1 < n * m && a[ord[j + 1].first][ord[j + 1].second] == a[ord[i].first][ord[i].second]){
			++j;
			if (!cur.empty() && *cur.begin() < ord[j].second){
				cur.erase(prev(cur.lower_bound(ord[j].second)));
				++cnt;
			}
			else{
				add.push_back(ord[j].second);
			}
		}
		for (int x : add){
			cur.insert(x);
		}
		i = j;
	}
	cout << (cnt >= n ? "YES" : "NO") << '\n';
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	int t;
	cin >> t;
	while (t--) solve();
}