1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using db = long double;

using pi = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pi>;

#define mp make_pair
#define pb push_back
#define eb emplace_back
#define x first
#define y second

#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define rep(i,a,b) for(int i = (a); i < (b); i++)
#define per(i,a,b) for(int i = (b) - 1; i >= (a); i--)

#ifdef LOCAL
template<class A, class B> auto& operator<<(auto &o, pair<A, B> p) { return o << '(' << p.x << ", " << p.y << ')'; }
template<class... A> auto& operator<<(auto &o, tuple<A...> t) {
	bool is_first = true;
	o << "(";
	apply([&o, &is_first](auto... a) {((o << (is_first ? (is_first = false, "") : ", ") << a), ...);}, t);
	o << ")";
	return o;
}
auto& operator<<(auto& o, auto a) {
	bool is_first = true;
	o << "{";
	for (auto b : a) o << (is_first ? (is_first = false, "") : ", ") << b;
	return o << "}";
}
void dump(auto... x) {
	bool is_first = true;
	((cerr << (is_first ? (is_first = false, "") : ", ") << x), ...) << "\n";
}
#define debug(x...) cerr << "[" #x "]: ", dump(x)
#else
#define debug(...) ;
#endif

template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

constexpr int N = 2007;

string input[N];
int cnt_rows[N][256], cnt_cols[N][256];
int diff_rows[N], diff_cols[N];

signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int h, w;
	cin >> h >> w;
	rep(row, 0, h) cin >> input[row];

	rep(row, 0, h) {
		rep(col, 0, w) {
			int cur = input[row][col];
			if (cnt_rows[row][cur]++ == 0) diff_rows[row]++;
			if (cnt_cols[col][cur]++ == 0) diff_cols[col]++;
		}
	}

	queue<pair<int, int>> q;
	rep(row, 0, h) {
		if (diff_rows[row] == 1) q.emplace(0, row);
	}
	rep(col, 0, w) {
		if (diff_cols[col] == 1) q.emplace(1, col);
	}

	vector<tuple<int, int, char>> result;
	while (!q.empty()) {
		auto [type, i] = q.front();
		q.pop();
		if (type == 0) {
			int row = i;
			int c = 0;
			rep(col, 0, w) {
				if (input[row][col] != 0) {
					c = input[row][col];
					break;
				}
			}
			if (c != 0) {
				result.eb(0, row, c);
				rep(col, 0, w) {
					if (input[row][col] != 0) {
						if (--cnt_cols[col][c] == 0) {
							if (--diff_cols[col] == 1) {
								q.emplace(1, col);
							}
						}
						input[row][col] = 0;
					}
				}
			}
		}
		else {
			int col = i;
			int c = 0;
			rep(row, 0, h) {
				if (input[row][col] != 0) {
					c = input[row][col];
					break;
				}
			}
			if (c != 0) {
				result.eb(1, col, c);
				rep(row, 0, h) {
					if (input[row][col] != 0) {
						if (--cnt_rows[row][c] == 0) {
							if (--diff_rows[row] == 1) {
								q.emplace(0, row);
							}
						}
						input[row][col] = 0;
					}
				}
			}
		}
	}

	reverse(all(result));
	cout << sz(result) << "\n";
	for (const auto &[type, i, c] : result) {
		cout << (type == 0 ? "R" : "K") << " " << i + 1 << " " << c << "\n";
	}
	
	return 0;
}