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
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#ifdef DEBUG
#include "debug.h"
#else
#define debug(...) 42
#endif

#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)

#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, n, m) for (int i = (n); i < (m); ++i)

#define repr(i, n) for (int i = (n) - 1; i >= 0; --i)
#define reppr(i, n, m) for (int i = (m) - 1; i >= (n); --i)

#define each(a,x) for(auto& a : (x))
#define sz(x) int((x).size())

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using pi = pair<int, int>;
using pll = pair<ll, ll>;

template <typename T, typename V> void mini(T& a, V b) {if (b < a) a = b; }
template <typename T, typename V> void maxi(T& a, V b) {if (b > a) a = b; }

void solve() {
    int n, m;
    cin >> n >> m;

    vector<string> board(n);
    rep(i, n)
        cin >> board[i];

    vector<array<int, 26>> perrow(n), percol(m);
    rep(i, n) rep(j, m) {
        int id = board[i][j] - 'A';
        ++perrow[i][id];
        ++percol[j][id];
    }

    using op = tuple<char, int, char>;
    vector<op> ops;

    bool fin = false;
    while (!fin) {
        fin = true;

        rep(i, n) {
            auto it = max_element(all(perrow[i]));
            int cumul = accumulate(all(perrow[i]), 0);
            if (!*it || cumul != *it)
                continue;
            int id = it - perrow[i].begin();

            rep(j, m) if (board[i][j]) {
                board[i][j] = 0;
                --percol[j][id];
            }
            fill(all(perrow[i]), 0);
            fin = false;

            ops.emplace_back('R', i, id + 'A');
        }
        rep(j, m) {
            auto it = max_element(all(percol[j]));
            int cumul = accumulate(all(percol[j]), 0);
            if (!*it || cumul != *it)
                continue;
            int id = it - percol[j].begin();

            rep(i, n) if (board[i][j]) {
                board[i][j] = 0;
                --perrow[i][id];
            }
            fill(all(percol[j]), 0);
            fin = false;

            ops.emplace_back('K', j, id + 'A');
        }

    }

    reverse(all(ops));
    cout << sz(ops) << '\n';
    for (auto [t, id, col] : ops)
        cout << t << ' ' << id+1 << ' ' << col << '\n';
}

int main() {
#ifdef DEBUG
    const int MEMSIZE = 1024 * 1024 * 1024;
    static_assert(MEMSIZE % 16 == 0);
    static char stack[MEMSIZE];
    asm volatile (
        "mov %[newstack], %%rsp\n"
        "call *%[funcptr]"
        :: [funcptr] "r" (solve), [newstack] "r" (stack + MEMSIZE)
    );
    exit(0);
#else
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
#endif
}