import sys
sys.setrecursionlimit(10 **8)

N,M,Q = map(int,input().split())
S = [input() for _ in range(N)]
T = [[0] * 7 for _ in range(N)]
for u in range(N):
    for j in range(7):
        if S[u][j] == "1":
            T[u][j] = 1
S = T
G = [[] for _ in range(N)]
for _ in range(M):
    u,v = map(int,input().split())
    u -= 1
    v -= 1
    G[u].append(v)
    G[v].append(u)

C = 7 * N
parent = [-1] * C
def find(i):
    if parent[i] < 0:return i
    parent[i] = find(parent[i])
    return parent[i]
def unite(i,j):
    I = find(i)
    J = find(j)
    if I == J:return False
    if parent[I] < parent[J]:
        I,J = J,I
    parent[J] += parent[I]
    parent[I] = J
    return True
for u in range(N):
    for j in range(7):
        k = (j + 1) % 7
        if S[u][j] == 1 and S[u][k] == 1:
            unite(u * 7 + j,u * 7 + k)
    for j in range(7):
        for v in G[u]:
            if S[u][j] == 1 and S[v][j] == 1:
                unite(u * 7 + j,v * 7 + j)
for _ in range(Q):
    t,x,y = map(int,input().split())
    x -= 1
    y -= 1
    if t == 1:
        S[x][y] = 1
        for j in (y-1,y+1):
            j %= 7
            if S[x][j] == 1:
                unite(x * 7 + y,x * 7 + j)
        for v in G[x]:
            if S[v][y] == 1:
                unite(x * 7 + y,v * 7 + y)
    else:
        ans = parent[find(x * 7)]
        print(-ans)