#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
std::pair<T, U> operator+(const std::pair<T, U>& l, const std::pair<T, U>& r) {
  return {l.first + r.first, l.second + r.second};
}
typedef void (*callback_function)(void);
const long long ZERO = 0LL;
const long long INF64 = 1e18;
const long long INF32 = 1e9;
const long long MOD = 1e9 + 7;
const long double PI = acos(-1.0L);
const long double EPS = static_cast<long double>(1e-9);
inline long long Pow(long long a, long long k) {
  long long s = 1;
  for (; k; k >>= 1) {
    k& 1 ? s = 1LL * s * a % MOD : 0;
    a = 1LL * a * a % MOD;
  }
  return s;
}
const long long N = 1e6 + 7;
void input() {}
void preprocess() {}
void debug() {
  if (true) {
  }
}
void solve() {
  preprocess();
  long long n, m;
  cin >> n >> m;
  long long a[n][m];
  for (long long i = (0); i < (n); i++)
    for (long long j = (0); j < (m); j++) {
      cin >> a[i][j];
    }
  long long dp[n][m];
  for (long long j = (0); j < (m); j++) {
    dp[0][j] = 0;
    for (long long i = (1); i < (n); i++) {
      if (a[i][j] >= a[i - 1][j]) {
        dp[i][j] = dp[i - 1][j];
      } else {
        dp[i][j] = i;
      }
    }
  }
  long long mn[n];
  for (long long i = (0); i < (n); i++) {
    mn[i] = INF64;
    for (long long j = (0); j < (m); j++) {
      mn[i] = min(mn[i], dp[i][j]);
    }
  }
  long long q;
  cin >> q;
  for (long long i = (0); i < (q); i++) {
    long long L, R;
    cin >> L >> R;
    L--, R--;
    cout << (mn[R] <= L ? "Yes" : "No") << endl;
  }
}
void output() {}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie();
  {
    input();
    solve();
    output();
  }
  return 0;
}
