#include <cstdio>

 #include <cstring>

 #include <algorithm>

 using namespace std;

 const int maxn = ;

 int n, m, q, val[maxn][maxn], dp[maxn][maxn][][];   //dp[i][j][k][l]表示左上角为(i,j),右下角为(i + 2 ^ k - 1, j + 2 ^ l - 1)这个矩形内的最值

 void rmq_init(int n, int m){

     for (int i = ; i <= n; i++) {

         for (int j = ; j <= m; j++)

             dp[i][j][][] = val[i][j];

     }

     for (int x = ; (<<x) <= n; x++)

         for (int y = ; (<<y) <= m; y++)

             if (x + y){

                 for (int i = ; i + (<<x) -  <= n; i++)

                     for (int j = ; j + (<<y) -  <= m; j++) {

                         if (x)   //在y轴方向比较

                             dp[i][j][x][y] = max(dp[i][j][x-][y], dp[i+(<<(x-))][j][x-][y]);

                         else   //在x轴方向比较

                             dp[i][j][x][y] = max(dp[i][j][x][y-], dp[i][j+(<<(y-))][x][y-]);

                     }

             }

 }

 int rmq_query(int x1, int y1, int x2, int y2) {

     int x = , y = ;

     while ((<<(x+)) <= x2 - x1 + ) x++;

     while ((<<(y+)) <= y2 - y1 + ) y++;

     x2 = x2 - (<<x) + ;

     y2 = y2 - (<<y) + ;

     return max( max(dp[x1][y1][x][y], dp[x2][y1][x][y]), max(dp[x1][y2][x][y], dp[x2][y2][x][y]));

 }

 int main () {

     while (scanf("%d%d", &n, &m) == ) {

         for (int i = ; i <= n; i++) {

             for (int j = ; j <= m; j++)

                 scanf("%d", &val[i][j]);

         }

         rmq_init(n, m);

         scanf("%d", &q);

         int x1, y1, x2, y2;

         while (q--) {

             scanf("%d%d%d%d", &x1, &y1, &x2, &y2);

             int ans = rmq_query(x1, y1, x2, y2);

             bool flag = false;

             if (ans == val[x1][y1] || ans == val[x1][y2] || ans == val[x2][y1] || ans == val[x2][y2])   //检查最值是否在子矩阵的四个顶角上

                 flag = true;

             printf("%d %s\n", ans, flag ? "yes" : "no");

         }

     }

     return ;

 }