#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; }
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T>& V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> >& Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T>& mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }
template<typename T>vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
/*
 <url:>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */

/*
 UnionFind
 */
struct UnionFind {
    vector<int> data;
    UnionFind(int size) : data(size, -1) { }
    bool unionSet(int x, int y) {
        x = root(x); y = root(y);
        if (x != y) {
            if (data[y] < data[x]) swap(x, y);
            data[x] += data[y]; data[y] = x;
        }
        return x != y;
    }
    bool findSet(int x, int y) {
        return root(x) == root(y);
    }
    int root(int x) {
        return data[x] < 0 ? x : data[x] = root(data[x]);
    }
    int size(int x) {
        return -data[root(x)];
    }
};

template<class Type>
Type solve(Type res = Type()){
    int N,M,Q; cin >> N >> M >> Q;

    auto convert_id = [&](int v,int c){
        return v*7 + c;
    };

    UnionFind UF(N*7);

    vector<string> state(N);

    for(int i = 0; i < N;i++){
        cin >> state[i];

        for(int j = 0; j < 7;j++){
            int k = (j+1)%7;

            if(state[i][j] == '1' && state[i][k] == '1'){
                UF.unionSet(convert_id(i,j),convert_id(i,k));
            }
        }
    }

    vector<vector<int>> G(N);
    for(int i = 0; i < M;i++){
        int u,v; cin >> u >> v;
        u--; v--;
        G[u].emplace_back(v);
        G[v].emplace_back(u);

        for(int j = 0; j < 7;j++){
            if(state[u][j] == '1' && state[v][j] == '1'){
                UF.unionSet(convert_id(u,j),convert_id(v,j));
            }
        }
    }

    while(Q--){
        int com,x,y;
        cin >> com >> x >> y;
        x--; y--;

        if(com == 1){
            state[x][y] = '1';

            int l = (y+6)%7;
            if(state[x][l] == '1'){
                UF.unionSet(convert_id(x,y),convert_id(x,l));
            }
            int r = (y+1)%7;
            if(state[x][r] == '1'){
                UF.unionSet(convert_id(x,y),convert_id(x,r));
            }

            for(int v:G[x]){
                if(state[v][y] == '1'){
                    UF.unionSet(convert_id(x,y),convert_id(v,y));
                }
            }

        }else{

            cout << UF.size(convert_id(x,0)) << endl;
        }
    }
    return res;
}
int main(void) {
    cin.tie(0); ios::sync_with_stdio(false);
    solve<ll>(0);
    // cout << fixed << setprecision(12) << solve<ll>() << endl;
    return 0;
}