#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

struct CountUnionFind{
    int sz;     // vertex number
    vector<int> par;
    vector<int> rank;
    vector<int> cnt;

    CountUnionFind(int n) : sz(n) {
        par.resize(sz);
        rank.assign(sz, 0);
        cnt.assign(sz, 1);
        for(int i = 0; i < sz; ++i){
            par[i] = i;
        }
    }

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

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

    void unite(int x, int y){
        x = find(x), y = find(y);
        if(x == y)  return;
        if(rank[x] < rank[y]){
            par[x] = y;
            cnt[y] += cnt[x];
        }
        else{
            par[y] = x;
            cnt[x] += cnt[y];
            if(rank[x] == rank[y])  ++rank[x];
        }
    }

    int get_cnt(int x){
        return cnt[find(x)];
    }
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, M, Q;
    cin >> N >> M >> Q;
    vector<string> s(N);
    vector<vector<int>> graph(N);
    CountUnionFind uf(N * 7);
    for(int i = 0; i < N; ++i){
        cin >> s[i];
        for(int j = 0; j < 7; ++j){
            if(s[i][j] == '0')  continue;
            int k = (j - 1 + 7) % 7;
            if(s[i][k] == '1')  uf.unite(i * 7 + j, i * 7 + k);
            k = (j + 1) % 7;
            if(s[i][k] == '1')  uf.unite(i * 7 + j, i * 7 + k);
        }
    }
    
    for(int i = 0; i < M; ++i){
        int u, v;
        cin >> u >> v;
        --u, --v;
        graph[u].emplace_back(v);
        graph[v].emplace_back(u);
        for(int j = 0; j < 7; ++j){
            if(s[u][j] == '1' && s[v][j] == '1'){
                uf.unite(u * 7 + j, v * 7 + j);
            }
        }
    }
    
    for(int i = 0; i < Q; ++i){
        int t, x, y;
        cin >> t >> x >> y;
        --x, --y;
        if(t == 1){
            s[x][y] = '1';
            int j = (y - 1 + 7) % 7;
            if(s[x][j] == '1'){
                uf.unite(x * 7 + y, x * 7 + j);
            }
            j = (y + 1) % 7;
            if(s[x][j] == '1'){
                uf.unite(x * 7 + y, x * 7 + j);
            }
            for(int v : graph[x]){
                if(s[v][y] == '1')  uf.unite(x * 7 + y, v * 7 + y);
            }
        }
        else{
            cout << uf.get_cnt(uf.find(x * 7)) << '\n';
        }
    }

    return 0;
}