#include <bits/stdc++.h>

using namespace std;

#define iter(v) v.begin(), v.end()
#define SZ(v) int(v.size())
#define pb emplace_back
#define ff first
#define ss second

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

#ifdef zisk
void debug() { cerr << "\n"; }
template<class T, class ... U>
void debug(T a, U ... b){ cerr << a << " ", debug(b...); }
template<class T>
void pary(T l, T r) {
	while (l != r) cerr << *l << " ", l++;
	cerr << "\n";
}
#else
#define debug(...) void()
#define pary(...) void()
#endif

template<class A, class B>
ostream &operator<<(ostream &o, pair<A, B> p) {
	return o << '(' << p.ff << ',' << p.ss << ')';
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	int h, w, q;
	cin >> h >> w >> q;

	vector<int> ans(1 << h);

	auto get_contri = [&](int col, int flip) {
		int one = __builtin_popcount(col ^ flip);
		int zero = h - one;
		return min(one, zero + 1);
	};
	auto upd = [&](int col, int mul) {
		for (int i = 0; i < (1 << h); i++) {
			ans[i] += get_contri(col, i) * mul;
		}
	};

	vector<int> cols(w);
	for (int i = 0; i < h; i++) {
		string s;
		cin >> s;
		for (int j = 0; j < w; j++) {
			if (s[j] == '1') cols[j] |= 1 << i;
		}
	}
	for (int i = 0; i < w; i++)
		upd(cols[i], 1);
	
	int all = 0;
	auto get_ans = [&]() {
		int answer = w * h;
		for (int i = 0; i < (1 << h); i++) {
			int tans = ans[all ^ i];
			tans += __builtin_popcount(i);
			answer = min(answer, tans);
		}
		return answer;
	};
	cout << get_ans() << "\n";

	while (q--) {
		
		char type;
		cin >> type;

		if (type == 'P') {
			int i, j;
			cin >> i >> j;
			i--; j--;
			upd(cols[j], -1);
			cols[j] ^= 1 << i;
			upd(cols[j], 1);
		}
		else if (type == 'R') {
			int i;
			cin >> i;
			i--;
			all ^= 1 << i;
		}
		else {
			int j;
			cin >> j;
			j--;
			upd(cols[j], -1);
			cols[j] ^= ((1 << h) - 1);
			upd(cols[j], 1);
		}

		cout << get_ans() << "\n";

	}

}