#include <bits/stdc++.h>
#define F(i, a, b) for (int i = a; i <= b; i++)
using namespace std;
const int N = 1e5 + 10;
int L[N], R[N];
int f[1 << 8][N][2];
void solve() {
    int n, m, q;
    cin >> n >> m >> q;
    vector<int> sum(1 << n);
    vector a(n, vector<int>(m));
    F(i, 0, n - 1) {
        string s;
        cin >> s;
        F(j, 0, m - 1) a[i][j] = s[j] - '0';
    }

    F(x, 0, (1 << n) - 1) {
        F(j, 0, m - 1) {
            F(i, 0, n - 1) {
                int y = a[i][j] ^ ((x >> i) & 1);
                f[x][j][y]++;
            }
            sum[x] += min(f[x][j][0] + 1, f[x][j][1]);
        }
    }
    int nowl = 0;
    {
        int res = 1e7;
        F(x, 0, (1 << n) - 1) {
            res = min(res, sum[x] + __builtin_popcount(x ^ nowl));
        }
        cout << res << "\n";
    }
    while (q--) {
        char op;
        cin >> op;
        // cout << q << " " << op << endl;
        if (op == 'P') {
            int x, y;
            cin >> x >> y;
            x--, y--;
            a[x][y] ^= 1;
            int tmp = a[x][y] ^ L[x] ^ R[y];
            F(i, 0, (1 << n) - 1) {
                sum[i] -= min(f[i][y][0] + 1, f[i][y][1]);
                int now = ((i >> x) & 1) ^ tmp;
                f[i][y][now]++, f[i][y][now ^ 1]--;
                sum[i] += min(f[i][y][0] + 1, f[i][y][1]);
            }
        } else if (op == 'R') {
            int x;
            cin >> x;
            x--;
            nowl ^= (1 << x);

        } else {
            int y;
            cin >> y;
            y--;
            R[y] ^= 1;
            F(i, 0, (1 << n) - 1) {
                sum[i] -= min(f[i][y][1], f[i][y][0] + 1);
                swap(f[i][y][0], f[i][y][1]);
                sum[i] += min(f[i][y][1], f[i][y][0] + 1);
            }
        }
        int res = 1e7;
        F(x, 0, (1 << n) - 1) {
            res = min(res, sum[x] + __builtin_popcount(x ^ nowl));
        }
        cout << res << "\n";
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    solve();
    return 0;
}
/*
3 4 6
1010
1101
0010
R 2
P 3 1
K 2
P 2 1
K 4
P 3 4
*/