#include <bits/stdc++.h>
using namespace std;
#define rep(i,s,e) for (int i = s; i <= e; ++i)
#define rrep(i,s,e) for (int i = s; i >= e; --i)
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define len(a) (int)a.size()
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m; cin >> n >> m;
int g[n+2][m+2] = {};
rep (i,1,n) {
rep (j,1,m) {
cin >> g[i][j], g[i][j]^=1;
}
}
int Q; cin >> Q;
while (Q--) {
int x, y; cin >> x >> y;
int g2[n+2][m+2] = {};
memcpy(g2, g, sizeof(g));
g2[x][y] = 0;
rrep (i,n,1) {
rrep (j,m,1) {
bool b = 0;
if (i<n) b |= g2[i+1][j];
if (j<m) b |= g2[i][j+1];
if (i==n && j==m) b = 1;
g2[i][j] &= b;
}
}
cout << g2[1][1] << "\n";
if (g2[1][1]) g[x][y] = 0;
}
return 0;
}
