#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

class DisjointSet{
public:
  int N;
  vector<int> rank,p;
  vector<int> sz;
 
  DisjointSet(){}
  DisjointSet(int n):N(n),rank(n),p(n),sz(n){
    for(int i=0;i<N;i++) makeSet(i);
  }
 
  void makeSet(int x){
    p[x]=x;
    rank[x]=0;
    sz[x]=1;
  }
 
  bool same(int x,int y){
    return leader(x)==leader(y);
  }
 
  void unite(int x,int y){
    if(same(x,y)) return;
    link(leader(x),leader(y));
  }
 
  void link(int x,int y){
    if(rank[x]>rank[y]) swap(x,y);

    p[x]=y;
    sz[y]+=sz[x];
    if(rank[x]==rank[y]){
      ++rank[y];
    }
  }
 
  int leader(int x){
    if(x!=p[x]) p[x]=leader(p[x]);
    return p[x];
  }
 
  int size(int x){
    return sz[leader(x)];
  }
};

const int L=7;

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int N,M,Q;
  cin>>N>>M>>Q;
  vector<string> S(N);
  rep(i,N) cin>>S[i];
  vector<vector<int>> g(N);
  rep(i,M){
    int a,b;
    cin>>a>>b;
    a--;b--;
    g[a].push_back(b);
    g[b].push_back(a);
  }

  auto trans = [&](int a,int b){
    return a*L+b;
  };

  DisjointSet us(L*N);
  rep(i,N){
    for(int j=0;j<L;j++){
      if(S[i][j]=='1'&&S[i][(j+1)%L]=='1') us.unite(trans(i,j),trans(i,(j+1)%L));
    }
  }
  rep(i,N){
    for(auto nex:g[i]){
      rep(j,L){
        if(S[i][j]=='1'&&S[nex][j]=='1') us.unite(trans(i,j),trans(nex,j));
      }
    }
  }

  rep(q,Q){
    int t,x,y;
    cin>>t>>x>>y;

    if(t==1){
      x--;y--;
      S[x][y]='1';
      if(S[x][(y+1)%L]=='1') us.unite(trans(x,y),trans(x,(y+1)%L));
      if(S[x][(y-1+L)%L]=='1') us.unite(trans(x,y),trans(x,(y-1+L)%L));
      for(auto nex:g[x]){
        if(S[x][y]=='1'&&S[nex][y]=='1') us.unite(trans(x,y),trans(nex,y));
      }
    }else{
      x--;
      int ans=us.size(trans(x,0));
      cout<<ans<<"\n";
    }
  }

  return 0;
}