#include <bits/stdc++.h>

#define i64 long long int

#define pii pair<int, int>
#define mp make_pair
#define fi first
#define se second

#define eb emplace_back

using namespace std;

inline int Read() {int res; return scanf("%d", &res), res; }
inline i64 Read64() {i64 res; return scanf("%lld", &res), res; }

const int INF_32 = 1e9;
const i64 INF_64 = 1e18;

const int N = 8 + 5, M = 100000 + 5;

int n, m, q, a[N][M];
int b[1 << 8], c[M], h[N];
char s[M];

int Get() {
	int ans = INF_32;
	for(int i = 0; i < (1 << n); ++ i) {
		ans = min(ans, b[i] + __builtin_popcount(i));
//		cout << i << " " << b[i] << endl;
	}
	return ans;
}

int main() {
	n = Read(), m = Read(), q = Read();
	for(int i = 1; i <= n; ++ i) {
		scanf("%s", s + 1);
		for(int j = 1; j <= m; ++ j) a[i][j] = s[j] - '0';
	}
	
	for(int i = 0; i < (1 << n); ++ i) {
		for(int j = 1; j <= m; ++ j) c[j] = 0;
		for(int k = 1; k <= n; ++ k) {
			int v = 0;
			if((i >> (k - 1)) & 1) v = 1;
			else v = 0;
			for(int j = 1; j <= m; ++ j) {
				int opt = a[k][j] ^ v;
				c[j] += opt == 1;
			}
		}
		for(int j = 1; j <= m; ++ j) {
			if(c[j] > n - c[j]) b[i] += 1 + n - c[j];
			else b[i] += c[j];
//			cout << c[j] << " ";
		}
//		cout << endl << " " << i << " " << b[i] << endl;
	}
	printf("%d\n", Get());
	
	while(q --) {
		scanf("%s", s + 1);
		if(s[1] == 'P') {
			int x = Read(), y = Read();
			for(int i = 0; i < (1 << n); ++ i) {
				int tmp = 0;
				for(int k = 1; k <= n; ++ k) {
					int v = h[k];
					if((i >> (k - 1)) & 1) v ^= 1;
					tmp += (a[k][y] ^ v) == 1;
				}
				if(tmp > n - tmp) b[i] -= 1 + n - tmp;
				else b[i] -= tmp;
			}
			a[x][y] ^= 1;
			for(int i = 0; i < (1 << n); ++ i) {
				int tmp = 0;
				for(int k = 1; k <= n; ++ k) {
					int v = h[k];
					if((i >> (k - 1)) & 1) v ^= 1;
					tmp += (a[k][y] ^ v) == 1;
				}
				if(tmp > n - tmp) b[i] += 1 + n - tmp;
				else b[i] += tmp;
			}
		}
		if(s[1] == 'R') {
			int x = Read();
			for(int i = 0; i < (1 << n); ++ i) {
				if((i >> (x - 1)) & 1) swap(b[i], b[i ^ (1 << (x - 1))]);
			}
			h[x] ^= 1;
		}
		if(s[1] == 'K') {
			int x = Read();
//			for(int i = 1; i <= n; ++ i) {
//				for(int j = 1; j <= m; ++ j) cout << (a[i][j] ^ h[i]);
//				cout << endl;
//			}
			for(int i = 0; i < (1 << n); ++ i) {
				int tmp = 0;
				for(int k = 1; k <= n; ++ k) {
					int v = h[k];
					if((i >> (k - 1)) & 1) v ^= 1;
					tmp += (a[k][x] ^ v) == 1;
				}
//				cout << tmp << " ";
				if(tmp > n - tmp) b[i] -= 1 + n - tmp;
				else b[i] -= tmp;
			}
//			cout << endl;
			for(int i = 1; i <= n; ++ i) a[i][x] ^= 1;
//			for(int i = 1; i <= n; ++ i) {
//				for(int j = 1; j <= m; ++ j) cout << (a[i][j] ^ h[i]);
//				cout << endl;
//			}
			for(int i = 0; i < (1 << n); ++ i) {
				int tmp = 0;
				for(int k = 1; k <= n; ++ k) {
					int v = h[k];
					if((i >> (k - 1)) & 1) v ^= 1;
					tmp += (a[k][x] ^ v) == 1;
				}
//				cout << tmp << " ";
				if(tmp > n - tmp) b[i] += 1 + n - tmp;
				else b[i] += tmp;
			}
//			cout << endl;
		}
		
		printf("%d\n", Get());
	}
	
	return 0;
}