#include <bits/stdc++.h>

using namespace std;
using ll = long long;

struct UnionFind {
    int ngroup, N;
    vector<int> par, siz;

    UnionFind(int _N) : N(_N), par(_N), siz(_N){
        ngroup = _N;
        for(int i = 0; i < N; i++) par[i] = i, siz[i] = 1;
    }

    int root(int x) {
        if (par[x] == x) return x;
        return par[x] = root(par[x]);
    }

    int unite(int x, int y) {
        int rx = root(x), ry = root(y);
        if (rx == ry) return rx;
        ngroup--;
        if (siz[rx] > siz[ry]) swap(rx, ry);
        par[rx] = ry; siz[ry] += siz[rx];
        return ry;
    }

    bool same(int x, int y) {
        int rx = root(x), ry = root(y);
        return rx == ry;
    }

    int size(int x) {return siz[root(x)];}
    int group_count() {return ngroup;}

    vector<vector<int>> groups(){
        vector<int> rev(N); int nrt=0;
        for (int i=0; i<N; i++) if (root(i) == i) rev[i] = nrt, nrt++;
        vector<vector<int>> res(nrt);
        for (int i=0; i<N; i++) res[rev[root(i)]].push_back(i);

        return res;
    }
};

int main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);

    int N, M, Q, ans=0, t, x, y;
    cin >> N >> M >> Q;
    vector<vector<int>> E(N);
    vector<bool> ok(7*N+7);

    UnionFind tree(7*N+7);
    string s;
    for (int i=0; i<N; i++){
        cin >> s;
        for (int j=0; j<7; j++) if (s[j] == '1') ok[7*i+j] = 1;
    }

    for (int i=0; i<M; i++){
        cin >> x >> y; x--; y--;
        E[x].push_back(y);
        E[y].push_back(x);
    }

    auto f=[&](int i, int j)->void{
        if (ok[7*i+j]){
            if (ok[7*i+(j-1+7)%7]) tree.unite(7*i+j, 7*i+(j-1+7)%7);
            if (ok[7*i+(j+1)%7]) tree.unite(7*i+j, 7*i+(j+1)%7);
            for (auto to : E[i]){
                if (ok[7*to+j]) tree.unite(7*i+j, 7*to+j);
            }
        }
    };

    for (int i=0; i<N; i++){
        for (int j=0; j<7; j++) f(i, j);
    }

    while(Q){
        Q--;
        cin >> t >> x >> y;
        x--; y--;
        if (t == 1){
            ok[7*x+y] = 1;
            f(x, y);
        }
        else{
            cout << tree.size(7*x) << endl;
        }
    }
 
    return 0;
}