#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)

//#define ATCODER
#ifdef ATCODER
#include<atcoder/all>
using namespace atcoder;
#endif


#include <algorithm>
#include <utility>
#include <vector>



#include <limits.h>
#include <math.h>
#include <time.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#include <cassert>
#include <numeric>
#include <type_traits>

using namespace std;

#ifdef _MSC_VER
#include"stdafx.h"
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
	cerr << " " << (H);
	debug_out(T...);
}
#define DEBUG(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define DEBUG(...) 42
#endif

#define ll long long
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define VSORT(v) sort(v.begin(), v.end());
#define VREVERSE(v) reverse(v.begin(), v.end())

#define print(x) cout << (x) << '\n'
#define spa <<" "<<
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
//#define int long long
//#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i, v.size()) cout << v[i] << " \n"[i==(int)v.size()-1]
template <typename T1, typename T2> inline void chmin(T1 & a, T2 b) { if (a > b) a = b; }
template <typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 1e9 + 9;
constexpr int MAX = 500050;
const double pi = acos(-1);
constexpr double EPS = 1e-8;
constexpr ll LINF = 1e17 + 1;
constexpr int INF = 1e9 + 1;

struct UnionFind {
	int N;
	vector<int> siz;
	vector<int> par;
	vector<int> Rank;
	UnionFind(int n) : siz(n, 1), par(n), Rank(n, 0) {
		N = n;
		for (int i = 0; i < N; i++) par[i] = i;
	}
	int find(int x) {
		if (par[x] == x) {
			return x;
		}
		else {
			return par[x] = find(par[x]);
		}
	}
	void unite(int x, int y) {
		x = find(x);
		y = find(y);
		if (x == y) return;
		if (Rank[x] < Rank[y]) {
			par[x] = y;
			siz[x] += siz[y];
			siz[y] = siz[x];
		}
		else {
			siz[y] += siz[x];
			siz[x] = siz[y];
			par[y] = x;
			if (Rank[x] == Rank[y]) Rank[x]++;
		}
	}
	bool same(int x, int y) { return find(x) == find(y); }
};
vector<int>G[100010];
string S[100010];
void connect(int u, int v,UnionFind &uf) {
	REP(j, 7) {
		if (S[u][j] == '1'&&S[v][j] == '1')uf.unite(u * 7 + j, v * 7 + j);
	}
}
void solve() {
	int N, M, Q; cin >> N >> M >> Q;
	UnionFind uf(N * 7);
	REP(i, N)cin >> S[i];
	REP(i, N) {
		REP(j, 7) {
			if (S[i][j] == '1'&&S[i][(j+1)%7] == '1')uf.unite(i * 7 + j, i * 7 + (j + 1) % 7);
		}
	}
	REP(i, M) {
		int u, v; cin >> u >> v;
		u--, v--;
		G[u].push_back(v);
		G[v].push_back(u);
		connect(u, v,uf);
	}
	REP(_, Q) {
		int sign, x, y; cin >> sign >> x >> y;
		if (sign == 1) {
			y--;
			x--;
			S[x][y] = '1';
			for (auto v : G[x])connect(x, v, uf);
			if (S[x][(y + 1) % 7] == '1')uf.unite(x * 7 + y, x * 7 + (y + 1) % 7);
			if (S[x][(y - 1 + 7) % 7] == '1')uf.unite(x * 7 + y, x * 7 + (y - 1 + 7) % 7);
		}
		else {
			x--;
			print(uf.siz[uf.find(x*7)]);
		}
	}
}





signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	//int q; cin >> q; while (q--)
	solve();
}