// #include <atcoder/all>
// using namespace atcoder;
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define rrep(i, n) for (int i = (int)n-1; i >= 0; --i)
using namespace std;
using ll = long long;
template<typename T>
inline bool chmax(T& a, const T& b) {
    if (a < b){
        a = b;
        return true;
    }
    return false;
}
template<typename T>
inline bool chmin(T& a, const T& b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
/**
 * @brief 多次元 vector の作成
 * @author えびちゃん
 */
namespace detail {
    template<typename T, int N>
    auto make_vec(vector<int>& sizes, T const& x) {
        if constexpr (N == 1) {
            return vector(sizes[0], x);
        } else {
            int size = sizes[N-1];
            sizes.pop_back();
            return vector(size, make_vec<T, N-1>(sizes, x));
        }
    }
}
template<typename T, int N>
auto make_vec(int const(&sizes)[N], T const& x = T()) {
    vector<int> s(N);
    for (int i = 0; i < N; ++i) s[i] = sizes[N-i-1];
    return detail::make_vec<T, N>(s, x);
}
__attribute__((constructor))
void fast_io() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

struct unionfind {
    vector<int> d;
    unionfind(int n) : d(n, -1) {}
    int find(int x) {
        if (d[x] < 0) return x;
        return d[x] = find(d[x]);
    }
    bool unite(int x, int y) {
        x = find(x); y = find(y);
        if (x == y) return false;
        if (d[x] > d[y]) swap(x, y);
        d[x] += d[y];
        d[y] = x;
        return true;
    }
    bool same(int x, int y) { return find(x) == find(y); }
    int size(int x) { return -d[find(x)]; }
};

int main() {
    int n, m, q;
    cin >> n >> m >> q;
    vector<string> s(n);
    rep(i, n) cin >> s[i];

    auto g = make_vec<int>({n, 0});
    auto add_edge = [&](int i, int j) {
        g[i].push_back(j);
        g[j].push_back(i);
    };
    rep(i, m) {
        int u, v;
        cin >> u >> v;
        --u; --v;
        add_edge(u, v);
    }

    auto idx = [](int v, int c) { return 7 * v + c; };
    unionfind uf(7*n);
    
    rep(i, n) {
        rep(j, 7) {
            int k = (j+1) % 7;
            if (s[i][j] == '1' && s[i][k] == '1') {
                int u = idx(i, j), v = idx(i, k);
                uf.unite(u, v);
            }
        }
    }

    rep(u, n) {
        for (int v : g[u]) {
            rep(i, 7) if (s[u][i] == '1' && s[v][i] == '1') {
                uf.unite(idx(u, i), idx(v, i));
            }
        }
    }

    while (q--) {
        int t, x, y;
        cin >> t >> x >> y;
        --x; --y;
        if (t == 1) {
            s[x][y] = '1';
            if (s[x][(y+1) % 7] == '1') uf.unite(idx(x, y), idx(x, (y+1) % 7));
            if (s[x][(y+6) % 7] == '1') uf.unite(idx(x, y), idx(x, (y+6) % 7));
            for (int u : g[x]) {
                rep(i, 7) if (s[x][i] == '1' && s[u][i] == '1') {
                    uf.unite(idx(x, i), idx(u, i));
                }
            }
        } else {
            cout << uf.size(idx(x, 0)) << '\n';
        }
    }
}