#include<bits/stdc++.h>
using namespace std;

using ll = long long;
#define rep(i, n) for(ll i = 0; i < (n); ++i)
#define rep2(i, l, r) for(ll i = (l); i < (r); ++i)

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;

#define all(A) A.begin(), A.end()
#define elif else if
using pii = pair<ll, ll>;

bool chmin(auto &a, auto b) {return a > b ? a = b, 1 : 0;}
bool chmax(auto &a, auto b) {return a < b ? a = b, 1 : 0;}

struct IOS {
  IOS() {
    cin.tie(0);
    ios::sync_with_stdio(0);
  }
} iosetup;

template<class T>
void print(vector<T> a) {
  for(auto x : a) cout << x << ' ';
  cout << endl;
}

void print(auto x) {cout << x << endl;}

template<class Head, class... Tail>
void print(Head &&head, Tail &&...tail) {
  cout << head << ' ';
  print(forward<Tail>(tail)...);
}



void solve(){
  int h,w;
  cin>>h>>w;
  vvi a(h,vi(w));
  rep(i,h)rep(j,w){
    cin>>a[i][j];
  }
  vi rem;
  rep(i,h)rem.push_back(a[i][0]);
  for(int j=1;j<w;j++){
    sort(rem.rbegin(),rem.rend());
    multiset<int>s;
    rep(i,h)s.insert(a[i][j]);
    int cnt=0;
    for(auto x:rem){
      auto itr = s.lower_bound(x);
      if(itr == s.begin()){      
        cnt++;
      }
      else{
        itr--;
        s.erase(itr);
      }
    }
    vi B;
    for(auto x:s)B.push_back(x);
    sort(B.rbegin(),B.rend());
    rem.clear();
    rep(idx,cnt)rem.push_back(B[idx]);
  }
  if(rem.size()==0)cout<<"YES\n";
  else cout<<"NO\n";
}

int main(){
  int T;
  cin>>T;
  rep(i,T)solve();
}