#include <bits/stdc++.h>

//#include <atcoder/all>
#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
T div_floor(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T>
T div_ceil(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a > 0 ? (a - 1) / b + 1 : a / b;
}

constexpr lint mod = 1000000007;
constexpr lint INF = mod * mod;
constexpr int MAX = 200010;

typedef struct UnionFindTree {
    vector<int> par;

    UnionFindTree(int n) { par.resize(n, -1); }

    bool is_root(int x) { return par[x] < 0; }

    int find(int x) {
        if (is_root(x)) return x;
        return par[x] = find(par[x]);
    }

    int size(int x) { return -par[find(x)]; }

    bool unite(int x, int y) {
        x = find(x);
        y = find(y);
        if (x == y) return false;
        if (size(x) < size(y)) swap(x, y);
        par[x] += par[y];
        par[y] = x;
        return true;
    }

    bool same(int x, int y) { return find(x) == find(y); }
} UF;

int main() {
    int n, m, q;
    scanf("%d%d%d", &n, &m, &q);
    string s[n];
    rep(i, n) cin >> s[i];
    vector<int> G[n];
    UF uf(n * 7);
    rep(i, n) {
        rep(c, 7) {
            int nc = (c + 1) % 7;
            if (s[i][c] == '1' && s[i][nc] == '1') {
                uf.unite(i * 7 + c, i * 7 + nc);
            }
        }
    }
    rep(_, m) {
        int a, b;
        scanf("%d%d", &a, &b);
        --a;
        --b;
        G[a].push_back(b);
        G[b].push_back(a);
        rep(c, 7) if (s[a][c] == '1' && s[b][c] == '1') {
            uf.unite(a * 7 + c, b * 7 + c);
        }
    }

    rep(_, q) {
        int c, x, y;
        scanf("%d%d%d", &c, &x, &y);
        if (c == 1) {
            --x;
            --y;
            s[x][y] = '1';
            int ny = (y + 1) % 7, py = (y + 6) % 7;
            if (s[x][ny] == '1') {
                uf.unite(x * 7 + y, x * 7 + ny);
            }
            if (s[x][py] == '1') {
                uf.unite(x * 7 + y, x * 7 + py);
            }
            for (auto nv : G[x]) {
                if (s[nv][y] == '1') uf.unite(x * 7 + y, nv * 7 + y);
            }
        } else {
            --x;
            printf("%d\n", uf.size(x * 7));
        }
    }
}