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
#include <bits/stdc++.h>

using namespace std;
using LL = long long;
#define FOR(i, l, r) for(int i = (l); i <= (r); ++i)
#define REP(i, n) FOR(i, 0, (n) - 1)
#define ssize(x) int(x.size())

template<class A, class B> auto &operator<<(ostream &o, pair<A, B> p) {
    return o << '(' << p.first << ", " << p.second << ')';
}

template<class T> auto operator<<(ostream &o, T x) -> decltype(x.end(), o) {
    o << '{'; int i = 0; for (auto e : x) o << (", ")+2*!i++ << e;
    return o << '}';
}

#ifdef DEBUG
#define debug(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "), ...); }(x), cerr << '\n';
#else
#define debug(...) {}
#endif


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m;
    cin >> n >> m;
    vector<vector<int>> col(m, vector<int>('Z' + 1));
    vector<vector<int>> row(n, vector<int>('Z' + 1));
    vector<int> total_col(m), total_row(n);
    vector<vector<int>> grid(n, vector<int>(m));

    auto is_single_row = [&](int i) {
        FOR(j, 'A', 'Z') {
            if (total_row[i] == row[i][j])
                return j;
        }
        return 0;
    };

    auto is_single_column = [&](int i) {
        FOR(j, 'A', 'Z') {
            if (total_col[i] == col[i][j])
                return j;
        }
        return 0;
    };

    REP(i, n) {
        string s;
        cin >> s;
        REP(j, m)
            grid[i][j] = s[j];
    }
    REP(i, n) {
        REP(j, m) {
            int ch = grid[i][j];
            col[j][ch]++;
            row[i][ch]++;
        }
    }

    deque<pair<bool, int>> q;
    REP(i, n) {
        total_row[i] = m;
        if (is_single_row(i))
            q.push_back({true, i});
    }
    REP(j, m) {
        total_col[j] = n;
        if (is_single_column(j))
            q.push_back({false, j});
    }

    vector<pair<char, pair<int, char>>> ans;
    vector<bool> used_col(m), used_row(n);
    while (!q.empty()) {
        auto [is_row, k] = q.front();
        q.pop_front();

        if (is_row) {
            if (used_row[k])
                continue;
            used_row[k] = true;
            char ch = (char) is_single_row(k);
            ans.push_back({'R', {k, ch}});
            REP(j, m) {
                if (grid[k][j] == 0)
                    continue;
                grid[k][j] = 0;
                total_col[j]--;
                col[j][ch]--;
                if (is_single_column(j))
                    q.push_back({false, j});
            }
        }
        else {
            if (used_col[k])
                continue;
            used_col[k] = true;
            char ch = (char) is_single_column(k);
            ans.push_back({'K', {k, ch}});
            REP(i, n) {
                if (grid[i][k] == 0)
                    continue;
                grid[i][k] = 0;
                total_row[i]--;
                row[i][ch]--;
                if (is_single_row(i))
                    q.push_back({true, i});
            }
        }
    }

    reverse(ans.begin(), ans.end());
    cout << ssize(ans) << '\n';
    for (auto &[ch, p] : ans)
        cout << ch << ' ' << p.first + 1 << ' ' << p.second << '\n';

    return 0;
}