#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

struct UnionFind {
    vector<int> par;
    
    UnionFind(int n) : par(n, -1) {}

    int root(int x) {
        if (par[x] < 0) return x;
        else return par[x] = root(par[x]);
    }
    
    bool same(int x, int y) {
        return root(x) == root(y);
    }
    
    bool merge(int x, int y) {
        x = root(x); y = root(y);
        if (x == y) return false;
        if (par[x] > par[y]) swap(x, y);
        par[x] += par[y];
        par[y] = x;
        return true;
    }
    
    int size(int x) {
        return -par[root(x)];
    }
};


int main(){
    ll n,m,q;cin >> n >> m >>q;
    UnionFind uf(n*7);
    vector<string> g(n);
    vvl graph(n);
    rep(i,n)cin >> g[i];
    rep(i,m){
        ll a,b;cin >>a  >> b;a--;b--;
        graph[a].pb(b);
        graph[b].pb(a);
        rep(j,7){
            if(g[a][j]=='1'&&g[b][j]=='1'){
                uf.merge(n*j+a,n*j+b);
            }
        }
    }
    rep(i,n){
        rep(j,7){
            ll np=(j+1)%7;
            if(g[i][j]=='1'&&g[i][np]=='1')uf.merge(n*j+i,n*np+i);
        }
    }
    while(q--){
        ll t,a,b;cin >> t >>a  >> b;
        if(t==2){
            a--;cout << uf.size(a) <<endl;
        }
        else{
            a--;b--;
            g[a][b]='1';
            for(auto p:graph[a]){
                if(g[p][b]=='1')uf.merge(n*b+a,n*b+p);
            }
            ll l=(b-1+7)%7,r=(b+1)%7;
            if(g[a][l]=='1')uf.merge(n*l+a,n*b+a);
            if(g[a][r]=='1')uf.merge(n*r+a,n*b+a);
        }
    }
}