#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

struct UnionFind {
public:
	using size_type = int;
	
	UnionFind(size_type n) : n(n), size_(n, 1) {
		par.resize(n);
		std::iota(par.begin(), par.end(), 0);
	}
	
	size_type size(size_type x) { return size_[find(x)]; }
	
	size_type find(size_type x) {
		assert(x < n);
		while (par[x] != x) {
			par[x] = par[par[x]];
			x = par[x];
		}
		return x;
	}
	
	void unite(size_type x, size_type y) {
		x = find(x);
		y = find(y);
		if (x == y) return;
		if (size(x) > size(y)) std::swap(x, y);
		par[x] = y;
		size_[y] += size_[x];
	}
	
	bool issame(size_type x, size_type y) { return find(x) == find(y); }
	
private:
	size_type n;
	std::vector<size_type> size_, par;
};

int main() {
	int N, M, Q;
	cin >> N >> M >> Q;
	string color[N];
	REP(i, N) cin >> color[i];
	
	UnionFind uf(N * 7); // 色, 都市
	REP(i, N) REP(j, 7) {
		if (color[i][j] == '1' && color[i][(j + 1) % 7] == '1') uf.unite(j * N + i, (j + 1) % 7 * N + i);
	}
	
	vector<vector<int>> g(N);
	REP(i, M) {
		int u, v;
		scanf("%d %d", &u, &v);
		--u; --v;
		g[u].emplace_back(v);
		g[v].emplace_back(u);
		REP(j, 7) if (color[u][j] == '1' && color[v][j] == '1') uf.unite(j * N + u, j * N + v);
	}
	
	while (Q--) {
		int q, x, y;
		scanf("%d %d %d", &q, &x, &y);
		--x; --y;
		if (q == 1) {
			if (color[x][(y + 1) % 7] == '1') uf.unite(y * N + x, (y + 1) % 7 * N + x);
			if (color[x][(y + 6) % 7] == '1') uf.unite(y * N + x, (y + 6) % 7 * N + x);
			for (int v : g[x]) if (color[x][y] == '0' && color[v][y] == '1') uf.unite(y * N + x, y * N + v);
			color[x][y] = '1';
		}
		else printf("%d\n", uf.size(x));
	}
}