#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr ll LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

struct UnionFind {
  UnionFind(int n) : data(n, -1) {}

  int root(int ver) { return data[ver] < 0 ? ver : data[ver] = root(data[ver]); }

  bool unite(int u, int v) {
    u = root(u);
    v = root(v);
    if (u == v) return false;
    if (data[u] > data[v]) std::swap(u, v);
    data[u] += data[v];
    data[v] = u;
    return true;
  }

  bool same(int u, int v) { return root(u) == root(v); }

  int size(int ver) { return -data[root(ver)]; }

private:
  std::vector<int> data;
};

int main() {
  int n, m, q; cin >> n >> m >> q;
  vector<string> s(n); REP(i, n) cin >> s[i];
  UnionFind uf(n * 7);
  REP(i, n) REP(j, 7) {
    if (s[i][j] == '1' && s[i][(j + 1) % 7] == '1') uf.unite(i * 7 + j, i * 7 + (j + 1) % 7);
  }
  vector<vector<int>> graph(n);
  while (m--) {
    int u, v; cin >> u >> v; --u; --v;
    graph[u].emplace_back(v);
    graph[v].emplace_back(u);
    REP(i, 7) {
      if (s[u][i] == '1' && s[v][i] == '1') uf.unite(u * 7 + i, v * 7 + i);
    }
  }
  while (q--) {
    int query, x, y; cin >> query >> x >> y; --x;
    if (query == 1) {
      --y;
      s[x][y] = '1';
      if (s[x][(y + 6) % 7] == '1') uf.unite(x * 7 + (y + 6) % 7, x * 7 + y);
      if (s[x][(y + 1) % 7] == '1') uf.unite(x * 7 + y, x * 7 + (y + 1) % 7);
      for (int e : graph[x]) {
        if (s[e][y] == '1') uf.unite(x * 7 + y, e * 7 + y);
      }
    } else if (query == 2) {
      cout << uf.size(x * 7) << '\n';
    }
  }
  return 0;
}