#include <bits/stdc++.h>
using namespace std;
struct unionfind{
  vector<int> p, sz;
  unionfind(int N){
    p = vector<int>(N, -1);
    sz = vector<int>(N, 1);
  }
  int root(int x){
    if (p[x] == -1){
      return x;
    } else {
      p[x] = root(p[x]);
      return p[x];
    }
  }
  bool same(int x, int y){
    return root(x) == root(y);
  }
  void unite(int x, int y){
    x = root(x);
    y = root(y);
    if (x != y){
      p[x] = y;
      sz[y] += sz[x];
    }
  }
  int size(int x){
    return sz[root(x)];
  }
};
int next(int x){
  return (x + 1) % 7;
}
int prev(int x){
  return (x + 6) % 7;
}
int main(){
  int N, M, Q;
  cin >> N >> M >> Q;
  vector<string> s(N);
  for (int i = 0; i < N; i++){
    cin >> s[i];
  }
  vector<vector<int>> E(N);
  for (int i = 0; i < M; i++){
    int u, v;
    cin >> u >> v;
    u--;
    v--;
    E[u].push_back(v);
    E[v].push_back(u);
  }
  unionfind UF(N * 7);
  for (int i = 0; i < N; i++){
    for (int j = 0; j < 7; j++){
      if (s[i][j] == '1' && s[i][next(j)] == '1'){
        int u = i * 7 + j;
        int v = i * 7 + next(j);
        UF.unite(u, v);
      }
    }
  }
  for (int i = 0; i < N; i++){
    for (int j : E[i]){
      for (int k = 0; k < 7; k++){
        if (s[i][k] == '1' && s[j][k] == '1'){
          UF.unite(i * 7 + k, j * 7 + k);
        }
      }
    }
  }
  for (int i = 0; i < Q; i++){
    int t, x, y;
    cin >> t >> x >> y;
    if (t == 1){
      x--;
      y--;
      s[x][y] = '1';
      if (s[x][prev(y)] == '1'){
        int u = x * 7 + prev(y);
        int v = x * 7 + y;
        UF.unite(u, v);
      }
      if (s[x][next(y)] == '1'){
        int u = x * 7 + y;
        int v = x * 7 + next(y);
        UF.unite(u, v);
      }
      for (int j : E[x]){
        if (s[j][y] == '1'){
          int u = x * 7 + y;
          int v = j * 7 + y;
          UF.unite(u, v);
        }
      }
    }
    if (t == 2){
      x--;
      cout << UF.size(x * 7) << endl;
    }
  }
}