from collections import defaultdict

class UnionFind():
    def __init__(self, n):
        '''
        UnionFindクラス。nは要素数を表す。
        '''
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        '''
        要素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を含む集合と要素yを含む集合を合体する関数。
        基本的には、要素数が多い集合に統合される。
        要素数が同じときは要素yを含む集合に統合される。
        '''
        x = self.find(x)
        y = self.find(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 size(self, x):
        '''
        要素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 len(self.roots())

    def all_group_members(self):
        group_members = defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members

    def __str__(self):
        return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())

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

UF = UnionFind(7 * n)
for i in range(n):
    for j in G[i]:
        for c in range(7):
            if S[i][c] == S[j][c] == 1:
                UF.union(7 * i + c, 7 * j + c)
    for c in range(7):
        c2 = (c + 1) % 7
        if S[i][c] == S[i][c2] == 1:
            UF.union(7 * i + c, 7 * i + c2)

for _ in range(q):
    i, x, y = map(int, input().split())
    x -= 1
    y -= 1
    if i == 1:
        S[x][y] += 1
        for v in G[x]:
            if S[v][y] == 1:
                UF.union(7 * x + y, 7 * v + y)
        for c2 in [(y + 1) % 7, (y - 1) % 7]:
            if S[x][c2] == 1:
                UF.union(7 * x + y, 7 * x + c2)
    else:
        print(UF.size(7 * x))