1 //2016.8.20
 2 #include<iostream>
 3 #include<cstdio>
 4 #include<cstring>
 5 
 6 using namespace std;
 7 
 8 int mp[1005][1005], book[1005][1005];
 9 int dx[4] = {0, 1, 0, -1};
10 int dy[4] = {1, 0, -1, 0};
11 int n, m, x2, y2;
12 bool ok, fg;
13 
14 void dfs(int x, int y, int pd, int tt)//pd表示上一次的方向,tt表示转折的次数
15 {
16     if(tt>3)return ;
17     if(x == x2 && y == y2)
18     {
19         cout << "YES" << endl;
20         ok = true;
21         return ;
22     }
23     if(x<1||x>n||y<1||y>m||mp[x][y]!=0)return;
24     if(ok)return ;
25     book[x][y] = 1;
26     for(int i= 0; i < 4; i++)
27     {
28         int nx = x+dx[i];
29         int ny = y+dy[i];
30         if(book[nx][ny]==1)continue;
31         if(i != pd)
32             dfs(nx, ny, i, tt+1);    
33         else 
34             dfs(nx, ny, i, tt);
35         book[nx][ny] = 0;
36     }
37 }
38 int main()
39 {
40     int q, x1, y1;
41     while(cin>>n>>m)
42     {
43         if(n==0&&m==0)break;
44         for(int i = 1; i <= n; i++)
45               for(int j = 1; j <= m; j++)
46                 scanf("%d", &mp[i][j]);
47           
48         cin >> q;
49         while(q--)
50         {
51             scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
52             memset(book, 0, sizeof(book));
53             if(mp[x1][y1]==mp[x2][y2]&&mp[x1][y1]&&mp[x2][y2]&&x1>=1&&y1>=1&&x1<=n&&y1<=m&&x2>=1&&y2>=1&&x2<=n&&y2<=m)//剪枝
54             {
55                 ok = false;
56                 int tmp = mp[x1][y1];
57                 mp[x1][y1] = 0;
58                 dfs(x1, y1, -1, 0);
59                 mp[x1][y1] = tmp;
60                 if(!ok)cout << "NO" << endl;
61             }else
62             {
63                 cout << "NO" <<endl;
64             }
65         }
66     }
67 
68     return 0;
69 }