#include <bits/stdc++.h>
#define inf (0x7f7f7f7f)
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define Min(a, b) ((a) < (b) ? (a) : (b))
typedef long long ll;
using namespace std;
template <class T>
inline void read(T &x){
    int ch = 0, f = 0; x = 0;
    for(; !isdigit(ch); ch = getchar()) if(ch == '-') f = 1;
    for(; isdigit(ch); ch = getchar()) x = x * 10 + ch - 48;
    if(f) x = -x;
}
const int N = 2005;
int n,m,q;
int a[N][N], out[N][N][4], in[N][N][4]; // up down left right 1 2 3 4
bool check1(int ii, int jj, int i, int j){
    if(ii < 1 || ii > n || jj < 1 || jj > m) return false;
    return a[ii][jj] == a[i][j] + 1;
}
bool check2(int ii, int jj, int i, int j){
    if(ii < 1 || ii > n || jj < 1 || jj > m) return false;
    return a[ii][jj] == a[i][j] - 1;
}
int inget(int r1, int r2, int c1, int c2, int k){
    return in[r2][c2][k] - in[r1 - 1][c2][k] - in[r2][c1 - 1][k] + in[r1 - 1][c1 - 1][k];
}
int outget(int r1, int r2, int c1, int c2, int k){
    return out[r2][c2][k] - out[r1 - 1][c2][k] - out[r2][c1 - 1][k] + out[r1 - 1][c1 - 1][k];
}
bool get(int r1, int r2, int c1, int c2){
    int sumout = 0, sumin = 0;
    for(int k = 0; k < 4; k++){
        sumin += inget(r1, r2, c1, c2, k);
        sumout += outget(r1, r2, c1, c2, k);
    }
    sumin -= inget(r1, r1, c1, c2, 0);
    sumin -= inget(r2, r2, c1, c2, 1);
    sumin -= inget(r1, r2, c1, c1, 2);
    sumin -= inget(r1, r2, c2, c2, 3);
    sumout -= outget(r1, r1, c1, c2, 0);
    sumout -= outget(r2, r2, c1, c2, 1);
    sumout -= outget(r1, r2, c1, c1, 2);
    sumout -= outget(r1, r2, c2, c2, 3);
    int sum = (r2 - r1 + 1) * (c2 - c1 + 1) - 1;
    if(sumin != sum || sumout != sum) return false;
    return true;
}
int main(){
    read(n), read(m), read(q);
    for(int i = 1; i <= n; i++) for(int j = 1; j <= m; j++) read(a[i][j]);
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            if(check1(i - 1, j, i, j)) out[i][j][0] = 1;
            if(check1(i + 1, j, i, j)) out[i][j][1] = 1;
            if(check1(i, j - 1, i, j)) out[i][j][2] = 1;
            if(check1(i, j + 1, i, j)) out[i][j][3] = 1;
            if(check2(i - 1, j, i, j)) in[i][j][0] = 1;
            if(check2(i + 1, j, i, j)) in[i][j][1] = 1;
            if(check2(i, j - 1, i, j)) in[i][j][2] = 1;
            if(check2(i, j + 1, i, j)) in[i][j][3] = 1;
        }
    }
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            for(int k = 0; k < 4; k++){
                out[i][j][k] += out[i - 1][j][k] + out[i][j - 1][k] - out[i - 1][j - 1][k];
                in[i][j][k] += in[i - 1][j][k] + in[i][j - 1][k] - in[i - 1][j - 1][k];
            }
        }
    }
    for(int r1, r2, c1, c2, i = 1; i <= q; i++){
        read(r1), read(c1);
        read(r2), read(c2);
        if(get(r1, r2, c1, c2)) puts("YES");
        else puts("NO");
    }
}