#include <bits/stdc++.h>

#include <algorithm>
#include <cassert>
#include <vector>

namespace atcoder {

// Implement (union by size) + (path compression)
// Reference:
// Zvi Galil and Giuseppe F. Italiano,
// Data structures and algorithms for disjoint set union problems
struct dsu {
  public:
    dsu() : _n(0) {}
    dsu(int n) : _n(n), parent_or_size(n, -1) {}

    int merge(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        int x = leader(a), y = leader(b);
        if (x == y) return x;
        if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
        parent_or_size[x] += parent_or_size[y];
        parent_or_size[y] = x;
        return x;
    }

    bool same(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        return leader(a) == leader(b);
    }

    int leader(int a) {
        assert(0 <= a && a < _n);
        if (parent_or_size[a] < 0) return a;
        return parent_or_size[a] = leader(parent_or_size[a]);
    }

    int size(int a) {
        assert(0 <= a && a < _n);
        return -parent_or_size[leader(a)];
    }

    std::vector<std::vector<int>> groups() {
        std::vector<int> leader_buf(_n), group_size(_n);
        for (int i = 0; i < _n; i++) {
            leader_buf[i] = leader(i);
            group_size[leader_buf[i]]++;
        }
        std::vector<std::vector<int>> result(_n);
        for (int i = 0; i < _n; i++) {
            result[i].reserve(group_size[i]);
        }
        for (int i = 0; i < _n; i++) {
            result[leader_buf[i]].push_back(i);
        }
        result.erase(
            std::remove_if(result.begin(), result.end(),
                           [&](const std::vector<int>& v) { return v.empty(); }),
            result.end());
        return result;
    }

  private:
    int _n;
    // root node: -1 * component size
    // otherwise: parent
    std::vector<int> parent_or_size;
};

}  // namespace atcoder

#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for (int i = (n)-1; i >= 0; --i)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using namespace atcoder;
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;

int main() {
    int n, m, q;
    cin >> n >> m >> q;
    dsu d(n * 7);
    vector<string> s(n);
    rep(i, n) {
        cin >> s[i];
        rep(j, 7) {
            int jp = (j + 1) % 7;
            if (s[i][j] == '1' && s[i][jp] == '1') {
                d.merge(7 * i + j, 7 * i + jp);
            }
        }
    }
    VVI to(n);
    rep(j, m) {
        int u, v;
        cin >> u >> v;
        --u; --v;
        to[u].push_back(v);
        to[v].push_back(u);
        rep(j, 7) {
            if (s[u][j] == '1' && s[v][j] == '1') d.merge(7*u+j,7*v+j);
        }
    }
    while(q--) {
        int qt, x, y;
        cin >> qt >> x >> y;
        --x; --y;
        if (qt == 1) {
            s[x][y] = '1';
            for(int v: to[x]) {
                if (s[v][y] == '1') d.merge(7*x+y,7*v+y);
            }
            int ym = (y + 7 - 1) % 7, yp = (y + 1) % 7;
            for(int y2: {ym, yp}) {
                if (s[x][y2] == '1') d.merge(7*x+y,7*x+y2);
            }
        } else {
            int t = d.leader(7*x);
            //rep(i, n) rep(j, 7) if (d.leader(7*i+j) == t) {
            //    cout << i + 1 << ' ' << j + 1 << endl;
            //}
            cout << d.size(7*x) << '\n';
        }
    }
}