20240605
# from bisect import bisect_right,bisect_left
# import sys
# def f(l,r,t):
# global n,a,b
# # print(l,r,t)
# # print(a)
# # print(b)
# ri=(b[r]-b[t-1])-(a[t]*(r-t+1))
# # print(ri,b[r]-b[t-1],a[t],r-t+1,r-t)
# le=(a[t]*(t-l+1))-(b[t]-b[l-1])
# # print(le)
# return ri+le
# input=sys.stdin.readline
# n,q=map(int,input().split())
# a=list(map(int,input().split()))
# a.insert(0,0)
# b=[0 for i in range(n+1)]
# b[0]=a[0]
# for i in range(1,n+1):
# b[i]=b[i-1]+a[i]
# # print(a)
# # print(b)
# for i in range(q):
# l,r=map(int,input().split())
# ll=bisect_left(a,l,1,n+1)
# rr=bisect_right(a,r,1,n+1)-1
# m=(ll+rr)//2
# if ll>=rr:
# print('0')
# continue
# ma=max(f(ll,rr,rr),f(ll,rr,ll))
# mi=f(ll,rr,m)
# print(ma-mi)
# # print(l,r,m)
# # print(f(l,r,r),f(l,r,l),mi)
# # print(b)
def dp(x,y):
if x==n-1 and y==m-1:
return 0
n,m,k=map(int,input().split())
a=[]
d=[[1,0],[0,1]]
b=[[0 for i in range(m)]for j in range(n)]
for i in range(k):
d.append([i+1],[i+1])
for i in range(n):
t=input()
t=list(t)
a.append(t)
q=int(input())
for _ in range(q):
x,y=map(int,input().split())