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

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

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return
        self.group -= 1
        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

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

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

    def 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.parents) if x < 0]

    def group_count(self):
        return self.group

    def all_group_members(self):
        dic = {r:[] for r in self.roots()}
        for i in range(self.n):
            dic[self.find(i)].append(i)
        return dic

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

n, m, q = map(int, input().split())
S = [int(input()[::-1], 2) for _ in range(n)]
edges = [[] for _ in range(n)]
for _ in range(m):
    u, v = map(int, input().split())
    u -= 1
    v -= 1
    edges[u].append(v)
    edges[v].append(u)

UF = UnionFind(7 * n)
for u in range(n):
    for v in edges[u]:
        for c in range(7):
            if S[u] >> c & 1 and S[v] >> c & 1:
                UF.union(7 * u + c, 7 * v + c)
    for c in range(7):
        c2 = (c + 1) % 7
        if S[u] >> c & 1 and S[u] >> c2 & 1:
            UF.union(7 * u + c, 7 * u + c2)

for _ in range(q):
    t, x, y = map(int, input().split())
    x -= 1
    y -= 1
    if t == 1:
        S[x] |= 1 << y
        for v in edges[x]:
            if S[v] >> y & 1:
                UF.union(7 * x + y, 7 * v + y)
        for c in [(y - 1) % 7, (y + 1) % 7]:
            if S[x] >> c & 1:
                UF.union(7 * x + y, 7 * x + c)
    else:
        print(UF.size(7 * x))