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
#include <vector>
#include <cstdio>
#include <stack>
#include <algorithm>
#include <queue>
#include <map>
#include <cmath>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <cstring>
#include <bitset>
#include <iostream>
#include <queue>
#include <iomanip>
#include <complex>

using namespace std;

#define ALL(x) x.begin(), x.end()
#define UNIQUE(c) (c).resize(unique(ALL(c)) - (c).begin())
#define FOR(i, a, b) for(int i =(a); i <=(b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define RED(i, n) FORD(i, n, 1)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)
#define REPD(i, n) FORD(i, n-1,0)


const int maxn = 4012;
const long long mod = 998244353, inf = 1000000004000000004ll;
vector<tuple<char, int, char>>res;
int n,m, ilk, ilr;
map<char, int>k[maxn];
string s[maxn];
queue<int>q;
void solve() {
    cin>>n>>m;
    REP(i, n)cin>>s[i];
    REP(i, n){
        REP(j, m){
            k[j][s[i][j]] ++;
            k[m + i][s[i][j]] ++;
        }
    }
    REP(i, m + n)if(k[i].size() == 1)q.push(i);
    while(m > ilk && n > ilr){
        auto akt = q.front();
        q.pop();
        if(akt < m) {
            res.emplace_back('K', akt + 1, k[akt].begin()->first);
            ilk++;
            REP(i, n){
                k[i + m][s[i][akt]] --;
                if(k[i + m][s[i][akt]] == 0){
                    k[i + m].erase(s[i][akt]);
                    if(k[i + m].size() == 1)q.push(i + m);
                }
            }
        }
        else {
            akt -= m;
            res.emplace_back('R', akt + 1, k[akt + m].begin()->first);
            ilr ++;
            REP(j, m){
                k[j][s[akt][j]]--;
                if(k[j][s[akt][j]] == 0) {
                    k[j].erase(s[akt][j]);
                    if(k[j].size() == 1)q.push(j);
                }
            }
        }
    }
    cout<<res.size()<<"\n";
    reverse(res.begin(), res.end());
    for(auto [a, b, c] : res){
        cout<<a<<" "<<b<<" "<<c<<"\n";
    }
}

int main() {
    ios_base::sync_with_stdio(false), cin.tie(nullptr);
    int tt = 1;
//    cin >> tt;
    while (tt--) {
        solve();
    }
    return 0;
}