#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint1000000007;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

int main() {
    ll N, M, Q;
    cin >> N >> M >> Q;
    vector<string> s(N);
    rep(i, N){
        cin >> s[i];
    }
    vector<ll> u(M);
    vector<ll> v(M);
    rep(i, M){
        cin >> u[i] >> v[i];
        u[i]--;
        v[i]--;
    }
    vector<vector<ll>> graph(N);
    for (ll i = 0; i < M; i++){
        graph[u[i]].push_back(v[i]);
        graph[v[i]].push_back(u[i]);
    }
    dsu tree(N * 7);
    for (ll i = 0; i < N; i++){
        for (ll j = 0; j < 7; j++){
            if (s[i][j] == '1' && s[i][(j + 1) % 7] == '1'){
                tree.merge(i * 7 + j, i * 7 + (j + 1) % 7);
            }
        } 
    }
    for (ll i = 0; i < M; i++){
        for (ll j = 0; j < 7; j++){
            if (s[u[i]][j] == '1' && s[v[i]][j] == '1'){
                tree.merge(u[i] * 7 + j, v[i] * 7 + j);
            }
        }
    }
    for (ll i = 0; i < Q; i++){
        ll t;
        cin >> t;
        if (t == 1){
            ll x, y;
            cin >> x >> y;
            x--;
            y--;
            s[x][y] = '1';
            if (s[x][(y + 1) % 7] == '1'){
                tree.merge(x * 7 + y, x * 7 + (y + 1) % 7);
            }
            if (s[x][(y + 6) % 7] == '1'){
                tree.merge(x * 7 + (y + 6) % 7, x * 7 + y);
            }
            for (ll to: graph[x]){
                if (s[to][y] == '1'){
                    tree.merge(to * 7 + y, x * 7 + y);
                }
            }
        }
        else{
            ll x, y;
            cin >> x >> y;
            x--;
            cout << tree.size(x * 7) << endl;
        }
    }
}