from collections import defaultdict class UnionFind(): def __init__(self, n): self.n = n self.parents = [-1] * 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 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 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 = [[]] uf = UnionFind((N+1)*7) for i in range(1,N+1): S.append(list(input())) for j in range(7): if S[-1][j-1]=='1' and S[-1][j]=='1': uf.union(i*7+j%7,i*7+(j-1)%7) UV = [list(map(int,input().split())) for _ in range(M)] L = [[] for _ in range(N+1)] for u,v in UV: for i in range(7): if S[u][i]=='1' and S[v][i]=='1': uf.union(u*7+i,v*7+i) L[u].append(v) L[v].append(u) for _ in range(Q): q,x,y = map(int,input().split()) y = (y-1)%7 if q==1: S[x][y]='1' for j in range(7): if S[x][j-1]=='1' and S[x][j]=='1': uf.union(x*7+j%7,x*7+(j-1)%7) for l in L[x]: if S[l][y]=='1': uf.union(x*7+y,l*7+y) else: print(uf.size(x*7))