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
/*
Things to notice:
1. do not calculate useless values
2. do not use similar names
 
Things to check:
1. submit the correct file
2. time (it is log^2 or log)
3. memory
4. prove your naive thoughts 
5. long long
6. corner case like n=0,1,inf or n=m
7. check if there is a mistake in the ds or other tools you use
8. fileio in some oi-contest

9. module on time 
10. the number of a same divisor in a math problem
11. multi-information and queries for dp and ds problems
*/
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
const int mod=998244353;
const int inf=0x3f3f3f3f;
vector <array<int,3> > vec;
int n,m;
char g[2005][2005];
int cntr[2005][26],cntc[2005][26];
void solve()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		string str;
		cin>>str;
		for(int j=0;j<m;j++) g[i][j+1]=str[j];
		for(int j=1;j<=m;j++) cntr[i][g[i][j]-'A']++,cntc[j][g[i][j]-'A']++;
	}
	for(int i=1;i<=n+m;i++)
	{
		int flg=0;
		for(int j=1;j<=n;j++) if(cntr[j][0]>=0)
		{
			int cnt=0,ch=0;
			for(int c=0;c<26;c++) if(cntr[j][c]>0) cnt++,ch=c;
			if(cnt==1)
			{
				flg=1,cntr[j][ch]=-inf;
				vec.pb({0,j,ch});
				for(int k=1;k<=m;k++) cntc[k][g[j][k]-'A']--;
				break;
			}
		}
		if(flg) continue;
		for(int j=1;j<=m;j++) if(cntc[j][0]>=0)
		{
			int cnt=0,ch=0;
			for(int c=0;c<26;c++) if(cntc[j][c]>0) cnt++,ch=c;
			if(cnt==1)
			{
				flg=1,cntc[j][ch]=-inf;
				vec.pb({1,j,ch});
				for(int k=1;k<=n;k++) cntr[k][g[k][j]-'A']--;
				break;
			}
		}
	}
	cout<<vec.size()<<"\n";
	for(int i=vec.size()-1;i>=0;i--)
	{
		if(vec[i][0]==0) cout<<"R ";
		else cout<<"K ";
		cout<<vec[i][1]<<" "<<(char)(vec[i][2]+'A')<<"\n";
	}
	
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int _=1;
//	cin>>_;
	while(_--) solve();
	return 0;
}