#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

void solve(){
    
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m, q; cin >> n >> m >> q;
    vvi col(n, vi(7));
    rep(i, n){
        string s; cin >> s;
        rep(j, 7)col[i][j] = s[j] - '0';
    }
    dsu d(7*n);
    rep(i, n)rep(j, 7){
        if(col[i][j] == 1 && col[i][(j+1)%7] == 1){
            d.merge(7*i + j, 7*i + (j+1)%7);
        }
    }
    vvi adj(n);
    rep(i, m){
        int u, v; cin >> u >> v;
        u--; v--;
        adj[u].push_back(v);
        adj[v].push_back(u);
        rep(j, 7){
            if(col[u][j] == 1 && col[v][j] == 1){
                d.merge(7*u + j, 7*v + j);
            }
        }
    }

    while(q--){
        int i, x, y; cin >> i >> x >> y;
        if(i == 1){
            x--; y--;
            col[x][y] = 1;
            rep(j, 7){
                if(col[x][j] == 1 && col[x][(j+1)%7] == 1){
                    d.merge(7*x + j, 7*x + (j+1)%7);
                }
            }
            for(auto v : adj[x]){
                rep(j, 7){
                    if(col[x][j] == 1 && col[v][j] == 1){
                        d.merge(7*x + j, 7*v + j);
                    }   
                }
            }
        }else{
            x--;
            cout << d.size(7*x) << endl;
        }
    }

    return 0;
}