class UnionFind:
    __slots__ = ["n", "parent", "height", "size"]

    def __init__(self, n):
        self.n = n
        self.parent = [i for i in range(n)]
        self.height = [1] * n
        self.size = [1] * n

    def find(self, x):
        if self.parent[x] == x:
            return x
        else:
            self.parent[x] = self.find(self.parent[x])
            return self.parent[x]

    def unite(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x != y:
            if self.height[x] < self.height[y]:
                self.parent[x] = y
                self.size[y] += self.size[x]
            else:
                self.parent[y] = x
                self.size[x] += self.size[y]
                if self.height[x] == self.height[y]:
                    self.height[x] += 1

    def issame(self, x, y):
        return self.find(x) == self.find(y)

    def group_size(self, x):
        return self.size[self.find(x)]

    def group_members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parent) if i == x]

    def group_count(self):
        return len(self.roots())


N, M, Q = map(int, input().split())
uf = UnionFind(7 * N)
pair2int = lambda i, n: 7 * i + n
colors = [[s == "1" for s in input()] for _ in range(N)]
G = [[] for _ in range(N)]
for _ in range(M):
    u, v = (int(x) - 1 for x in input().split())
    G[u].append(v)
    G[v].append(u)

for i in range(N):
    for a in range(7):
        b = (a + 1) % 7
        if colors[i][a] == colors[i][b] == 1:
            uf.unite(pair2int(i, a), pair2int(i, b))

for i in range(N):
    for a in range(7):
        if not colors[i][a]:
            continue
        for j in G[i]:
            if colors[j][a]:
                uf.unite(pair2int(i, a), pair2int(j, a))
for _ in range(Q):
    q, x, y = map(int, input().split())
    x -= 1
    if q == 1:
        y -= 1
        colors[x][y] = 1

        l = (y - 1) % 7
        r = (y + 1) % 7
        if colors[x][l] == 1:
            uf.unite(pair2int(x, l), pair2int(x, y))
        if colors[x][r] == 1:
            uf.unite(pair2int(x, y), pair2int(x, r))

        for j in G[x]:
            if colors[j][y] == 1:
                uf.unite(pair2int(x, y), pair2int(j, y))
    else:
        assert q == 2
        print(uf.group_size(0))