#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;

string canShrekSortRows(int n, int m, vector<vector<int>>& matrix) {
    vector<vector<int>> sortedCols(m, vector<int>(n));
    for (int j = 0; j < m; ++j) {
        for (int i = 0; i < n; ++i) {
            sortedCols[j][i] = matrix[i][j];
        }
        sort(sortedCols[j].begin(), sortedCols[j].end(), greater<int>());
    }

    priority_queue<int, vector<int>, greater<int>> minHeap; // Min-heap
    int totalCount = 0;

    // Step 2: Process columns
    for (int j = m - 1; j >= 0; --j) {
        int X = minHeap.empty() ? -1 : minHeap.top();
        int localCount = 0;

        if (minHeap.empty()) {
            // If the heap is empty, add all column elements to the heap
            for (int num : sortedCols[j]) {
                minHeap.push(num);
            }
            continue;
        }

        // Step 3: Find the last number greater than X with totalCount + localCount <= heap size
        for (int k = 0; k < n; ++k) {
            if (sortedCols[j][k] > X && localCount <= minHeap.size()) {
                localCount++;
            } else {
                for (int l = k; l < n; ++l) {
                    minHeap.push(sortedCols[j][l]);
                }
                break;
            }
        }
        totalCount += localCount; // Accumulate the count

        if (totalCount >= n) {
            return "YES";
        }
    }

    return "NO";
}

int main() {
    int t;
    cin >> t;
    vector<string> results;

    while (t--) {
        int n, m;
        cin >> n >> m;
        vector<vector<int>> matrix(n, vector<int>(m));

        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < m; ++j) {
                cin >> matrix[i][j];
            }
        }

        results.push_back(canShrekSortRows(n, m, matrix));
    }

    // Output results for all test cases
    for (const string& result : results) {
        cout << result << endl;
    }

    return 0;
}