#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;

class UnionFind{
  int n;
  vector<int> data, sz;
public:
  UnionFind(int _n):n(_n),data(_n,-1),sz(_n,1){}
  bool link(int a, int b){ //if new link, then true.
    int ra=find_root(a);
    int rb=find_root(b);
    if(ra!=rb){
      if(data[rb]<data[ra]) swap(ra,rb);
      data[ra]+=data[rb];
      data[rb]=ra;

      int sum = sz[ra] + sz[rb];
      sz[ra] = sum;
      sz[rb] = sum;
    }
    return (ra!=rb);
  }
  bool check(int a, int b){ //if same set, then true.
    return (find_root(a)==find_root(b));
  }
  int find_root(int a){
    return ((data[a]<0)?a:(data[a]=find_root(data[a])));
  }
  int size(int a){
    return sz[find_root(a)];
  }
};

int get_index(int c, int i){
  return c * 100005 + i;
}

UnionFind uf(1000005);
vector<int> G[100005];

int main(){
  int N, M, Q;
  cin >> N >> M >> Q;
  vector<string> v;
  rep(i,N){
    string s;
    cin >> s;
    v.push_back(s);
    rep(j,s.size()){
      if(s[j] == '1' && s[(j+1)%(s.size())] == '1'){
        uf.link(get_index(j,i), get_index((j+1)%(s.size()),i));
      }
    }
  }
  rep(i,M){
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    G[a].push_back(b);
    G[b].push_back(a);

    rep(j,v[a].size()){
      if(v[a][j] == '1' && v[b][j] == '1'){
        uf.link(get_index(j,a), get_index(j,b));
      }
    }
  }

  rep(q,Q){
    int t, x, y;
    cin >> t >> x >> y;
    x--;
    y--;
    if(t == 1){
      v[x][y] = '1';
      if(v[x][(y-1+v[x].size())%(v[x].size())] == '1'){
        uf.link(get_index(y,x), get_index((y-1+v[x].size())%(v[x].size()),x));
      }
      if(v[x][(y+1)%(v[x].size())] == '1'){
        uf.link(get_index(y,x), get_index((y+1)%(v[x].size()),x));
      }
      rep(i,G[x].size()){
        int j = G[x][i];
        if(v[x][y] == '1' && v[j][y] == '1'){
          uf.link(get_index(y,x), get_index(y,j));
        }
      }
    }else{
      cout << uf.size(get_index(0,x)) << endl;
    }
  }
  
  
  return 0;
}