#include <bits/stdc++.h> /// kitsune using namespace std; #define fi first #define se second #define mp make_pair //#define int long long #define sz(x) (int)(x).size() #define all(x) (x).begin(), (x).end() #define rep(i, l, r) for (int i = (int)(l); i <= (int)(r); i++) #define per(i, r, l) for (int i = (int)(r); i >= (int)(l); i--) typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; template <typename _Tp> bool minimize(_Tp &__a, const _Tp &__b) { if (__a > __b) { __a = __b; return true; } return false; } template <typename _Tp> bool maximize(_Tp &__a, const _Tp &__b) { if (__a < __b) { __a = __b; return true; } return false; } const int siz = 1e3 + 2; const int SIZ = 1e6 + 2; const int mod = 1e9 + 7; const int maxx = 2e9; const ll MAXX = 1e18; const string file = "1"; int par[siz * siz], sze[siz * siz]; vector<int> adj[siz * siz]; int root(int u) { if (par[u] == u) { return u; } return par[u] = root(par[u]); } pii ans; void unite(int u, int v) { u = root(u); v = root(v); if (u == v) { return; } if (sz(adj[u]) > sz(adj[v])) { swap(u, v); } par[u] = v; sze[v] += sze[u]; for (auto x : adj[u]) { if (root(x) != v) { adj[v].push_back(root(x)); } } adj[u].clear(); ans.fi--; maximize(ans.se, sze[v]); } int n, m; char a[siz][siz]; int get_idx(int i, int j) { return (i - 1) * m + j; } pii get_cell(int x) { int i = (x - 1) / m + 1, j = x - (i - 1) * m; return mp(i, j); } bool vis[siz * siz]; signed main() { ios::sync_with_stdio(false); cin.tie(nullptr); // freopen((file + ".inp").c_str(), "r", stdin); // freopen((file + ".out").c_str(), "w", stdout); cin >> n >> m; rep(i, 1, n) rep(j, 1, m) { cin >> a[i][j]; par[get_idx(i, j)] = get_idx(i, j); sze[get_idx(i, j)] = 1; ans.fi++; maximize(ans.se, 1); for (auto d_ij : { mp(-1, 0), mp(0, -1) }) { int x = i + d_ij.fi, y = j + d_ij.se; if (1 > x || 1 > y) { continue; } if (a[i][j] == a[x][y]) { unite(get_idx(i, j), get_idx(x, y)); } else { adj[root(get_idx(i, j))].push_back(root(get_idx(x, y))); adj[root(get_idx(x, y))].push_back(root(get_idx(i, j))); } } } rep(i, 1, n) rep(j, 1, m) { int r = root(get_idx(i, j)); if (vis[r]) { continue; } vis[r] = true; sort(all(adj[r])); adj[r].resize(unique(all(adj[r])) - adj[r].begin()); } int q; cin >> q; while (q--) { char t; int x, y; cin >> t >> x >> y; tie(x, y) = get_cell(root(get_idx(x, y))); if (t != a[x][y]) { vector<int> tmp(all(adj[get_idx(x, y)])); adj[get_idx(x, y)].clear(); for (auto u : tmp) { unite(get_idx(x, y), u); } tie(x, y) = get_cell(root(get_idx(x, y))); a[x][y] = t; } cout << ans.fi << " " << ans.se << "\n"; } // cerr << "Time: " << 1000 * clock() / CLOCKS_PER_SEC << " ms\n"; return 0; }