#include<bits/stdc++.h>

using namespace std;

int m, n, l, r, k;
vector<string> res;
unsigned long temp[100000], t;
int main(){
    cin >> n >> m;
    int a[n+3][m+4];
    for(int i = 0; i < m; ++i){
        cin >> temp[i];
        a[0][i] = 0;
    }
    for(int i = 1; i < n; ++i){
        for(int j = 0; j < m; ++j){
            cin >> t;
            if(temp[j] <= t) a[i][j] = a[i-1][j] + 1;
            else a[i][j] = 0;
            temp[j] = t;
        }
    }

    for(int i = 0; i < n; ++i){
        sort(a[i], a[i] + m, greater<int>());
    }

    cin >> k;
    for(int i = 0; i < k; ++i){
        cin >> l >> r;
        l--, r--;
        if(l > r) swap(l, r);
        if(r - a[r][0] <= l) res.push_back("Yes");
        else res.push_back("No");
    }

    for(int i = 0; i < k; ++i) cout << res[i] << endl;

//    for(int i = 0; i < n; ++i){
//            cout << endl;
//        for(int j = 0; j < m; ++j) cout << a[i][j] << " ";
//    }


}