class Unionfind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def leader (self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.leader(self.parents[x])
            return self.parents[x]

    def merge(self, x, y):
        x = self.leader(x)
        y = self.leader(y)
        if x == y:
            return
        if self.parents[x] > self.parents[y]:
            x, y = y, x
        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def same(self, x):
        return self.leader(x) == self.leader(y)

    def size(self, x):
        return -self.parents[self.leader(x)]

n, m, q = map(int, input().split())
s = [input() for _ in range(n)]

uf = Unionfind(7 * n)
graph = [[] for _ in range(n)]
exist = [[s[i][j] == '1' for j in range(7)] for i in range(n)]

for i in range(n):
    for j in range(7):
        if exist[i][j] and exist[i][(j + 1) % 7]:
            uf.merge(7 * i + j, 7 * i + (j + 1) % 7)

for i in range(m):
    u, v = map(lambda x: int(x) - 1, input().split())
    for j in range(7):
        if exist[u][j] and exist[v][j]:
            uf.merge(7 * u + j, 7 * v + j)
    graph[u].append(v)
    graph[v].append(u)

for _ in range(q):
    t, x, y = map(lambda x: int(x) - 1, input().split())
    if t == 0:
        exist[x][y] = True
        if exist[x][(y + 6) % 7]:
            uf.merge(7 * x + (y + 6) % 7, 7 * x + y)
        if exist[x][(y + 8) % 7]:
            uf.merge(7 * x + y, 7 * x + (y + 8) % 7)
        for z in graph[x]:
            if exist[z][y]:
                uf.merge(7 * x + y, 7 * z + y)
    else:
        print(uf.size(7 * x))