#!/usr/bin/env python3

import queue

P2_string = input()
W, H = map(int, input().split())
max_hodnota = int(input())

obrazek = []
for _ in range(H):
    radek = list(map(int, input().split()))
    obrazek.append(radek)
    
K = int(input())

pozice_kybliku = []
for _ in range(K):
    (x, y, tolerance) = map(int, input().split())
    pozice_kybliku.append((x, y, tolerance))

def spocitej_vyplnene_pixely(obrazek, kyblik):
    x, y, tolerance = kyblik

    puvodni_jas = obrazek[y][x]
    min_jas = max(0, puvodni_jas - tolerance)
    max_jas = min(255, puvodni_jas + tolerance)

    fronta_pozic = queue.Queue()
    fronta_pozic.put((x, y))
    vyplnene = set()

    while not fronta_pozic.empty():
        px, py = fronta_pozic.get()
        if (px, py) in vyplnene:
            continue
        vyplnene.add((px, py))

        for dy, dx in [(-1, 0), (1, 0), (0, -1), (0, 1)]:
            nx = px + dx
            ny = py + dy
            if 0 <= ny < H and 0 <= nx < W:
                neighbour_colour = obrazek[ny][nx]
                if min_jas <= neighbour_colour <= max_jas:
                    fronta_pozic.put((nx, ny))
    return vyplnene

for kyblik in pozice_kybliku:
    vyplnene_pixely = spocitej_vyplnene_pixely(obrazek, kyblik)
    print(len(vyplnene_pixely))