#define MOD_TYPE 1 #pragma region Macros #include using namespace std; /* #include #include using multiInt = boost::multiprecision::cpp_int; using lld = boost::multiprecision::cpp_dec_float_100; */ #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") using ll = long long int; using ld = long double; using pii = pair; using pll = pair; using pld = pair; template using smaller_queue = priority_queue, greater>; constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353); //constexpr ll MOD = 1; constexpr int INF = (int)1e9; constexpr ll LINF = (ll)4e18; constexpr double PI = acos(-1.0); constexpr double EPS = 1e-10; constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0}; constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0}; #define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i) #define rep(i, n) REP(i, 0, n) #define REPI(i, m, n) for (int i = m; i < (int)(n); ++i) #define repi(i, n) REPI(i, 0, n) #define MP make_pair #define MT make_tuple #define YES(n) cout << ((n) ? "YES" : "NO") << "\n" #define Yes(n) cout << ((n) ? "Yes" : "No") << "\n" #define possible(n) cout << ((n) ? "possible" : "impossible") << "\n" #define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n" #define Yay(n) cout << ((n) ? "Yay!" : ":(") << "\n" #define all(v) v.begin(), v.end() #define NP(v) next_permutation(all(v)) #define dbg(x) cerr << #x << ":" << x << "\n"; inline void init_main() { cin.tie(0); ios::sync_with_stdio(false); cout << setprecision(30) << setiosflags(ios::fixed); } template inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } inline ll CEIL(ll a, ll b) { return (a + b - 1) / b; } template inline void Fill(A (&array)[N], const T &val) { fill((T *)array, (T *)(array + N), val); } template constexpr ostream &operator<<(ostream &os, pair &p) noexcept { os << p.first << " " << p.second; return os; } #pragma endregion class UnionFind { private: vector par, sizes; public: UnionFind(int n = 200010) : par(n), sizes(n, 1) { iota(par.begin(), par.end(), 0); } int root(int x) { if (x == par[x]) return x; return par[x] = root(par[x]); } void unite(int x, int y) { x = root(x); y = root(y); if (x == y) return; if (sizes[x] < sizes[y]) swap(x, y); par[y] = x; sizes[x] += sizes[y]; } bool same(int x, int y) { return root(x) == root(y); } int size(int x) { return sizes[root(x)]; } }; void solve() { int n, m, q; cin >> n >> m >> q; string s[50000]; vector E[50000]; rep(i, n) cin >> s[i]; rep(i, m) { int a, b; cin >> a >> b; a--, b--; E[a].push_back(b); E[b].push_back(a); } UnionFind uf(n * 7); rep(i, n) rep(j, 7) { if (s[i][j] == '0') continue; for (auto to : E[i]) { if (s[to][j] == '1') uf.unite(i * 7 + j, to * 7 + j); } int up = (j + 1) % 7, down = (j - 1 + 7) % 7; if (s[i][up] == '1') uf.unite(i * 7 + j, i * 7 + up); if (s[i][down] == '1') uf.unite(i * 7 + j, i * 7 + down); } rep(qi, q) { int type, x, y; cin >> type >> x >> y; x--, y--; s[x][y] = '1'; if (type == 1) { for (auto to : E[x]) { if (s[to][y] == '1') uf.unite(x * 7 + y, to * 7 + y); } int up = (y + 1) % 7, down = (y - 1 + 7) % 7; if (s[x][up] == '1') uf.unite(x * 7 + y, x * 7 + up); if (s[x][down] == '1') uf.unite(x * 7 + y, x * 7 + down); } else { cout << uf.size(x * 7) << "\n"; } } } int main() { init_main(); solve(); return 0; }