#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

class union_find {
  public:
    union_find(int n) : data(n, -1) {}
    int unite(int x, int y) {
        x = root(x), y = root(y);
        if(x != y) {
            if(size(x) < size(y)) swap(x, y);
            data[x] += data[y];
            return data[y] = x;
        }
        return -1;
    }
    int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
    int size(int x) { return -data[root(x)]; }
    bool same(int x, int y) { return root(x) == root(y); }

  private:
    vector<int> data;
};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int N,M,Q; cin >> N >> M >> Q;
    vector<int> A(N);
    rep(i,N) {
        rep(j,7) {
            char c; cin >> c;
            if(c == '1') A[i] |= (1 << j);
        }
    }

    union_find uf(N * 7);
    auto h = [](int v, int c) { return v * 7 + c; };
    vector<vector<int>> G(N);
    rep(_,M) {
        int u,v; cin >> u >> v; u--; v--;
        G[u].push_back(v);
        G[v].push_back(u);
        rep(j,7) if((A[u] & (1 << j)) && ((A[v] & (1 << j)))) uf.unite(h(u, j), h(v, j));
    }
    rep(v,N) rep(i,7) {
        int j = (i + 1) % 7;
        if((A[v] & (1 << i)) && (A[v] & (1 << j))) uf.unite(h(v, i), h(v, j));
    }

    rep(_,Q) {
        int t,x,y; cin >> t >> x >> y; x--; y--;
        if(t == 1) {
            A[x] |= (1 << y);
            for(int v : G[x])
                if(A[v] & (1 << y)) uf.unite(h(x, y), h(v, y));
            for(int z : {(y + 1) % 7, (y - 1 + 7) % 7})
                if(A[x] & (1 << z)) uf.unite(h(x, y), h(x, z));
        } else {
            cout << uf.size(h(x, 0)) << "\n";
        }
    }
}