#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<multiset<int>> cur(m);
	forn(i, n) forn(j, m) cur[j].insert(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){
		return a[x.first][x.second] > a[y.first][y.second];
	});
	int cnt = 0;
	for (auto [x, y] : ord){
		if (y > 0 && !cur[y - 1].empty() && *cur[y - 1].rbegin() > a[x][y]){
			++cnt;
			cur[y].erase(cur[y].find(a[x][y]));
			cur[y - 1].erase(--cur[y - 1].end());
		}
	}
	cout << (cnt >= n ? "YES" : "NO") << '\n';
}

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