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

using namespace std;

struct AnswerRow {
    char type;
    int number;
    char color;

    AnswerRow(char type, int number, char color) : type(type), number(number), color(color) {}
};

std::ostream& operator<<(std::ostream &strm, const AnswerRow &a) {
    return strm << a.type << " " << a.number << " " << a.color;
}

void solve() {
    int n, m;
    cin >> n >> m;
    vector<string> rows(n);
    for (int i = 0; i < n; i++) {
        cin >> rows[i];
    }

    vector<unordered_map<char, int>> mapByRow(n);
    vector<unordered_map<char, int>> mapByColumn(m);

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            mapByRow[i][rows[i][j]]++;
            mapByColumn[j][rows[i][j]]++;
        }
    }

    vector<AnswerRow> ans;

    int blankCount = 0;
    while (blankCount != n * m) {
        char type;
        int number;
        char color;
        bool found = false;
        for (int i = 0; i < n; i++) {
            if (mapByRow[i].size() == 1) {
                type = 'R';
                number = i;
                color = mapByRow[i].begin()->first;
                int count = mapByRow[i].begin()->second;
                blankCount += count;
                mapByRow[i].clear();
                for (int j = 0; j < m; j++) {
                    if (mapByColumn[j].count(color)) {
                        mapByColumn[j][color]--;
                        if (mapByColumn[j][color] == 0) {
                            mapByColumn[j].erase(color);
                        }
                    }
                }
                found = true;
                break;
            }
        }
        if (!found) {
            for (int i = 0; i < m; i++) {
                if (mapByColumn[i].size() == 1) {
                    type = 'K';
                    number = i;
                    color = mapByColumn[i].begin()->first;
                    int count = mapByColumn[i].begin()->second;
                    blankCount += count;
                    mapByColumn[i].clear();
                    for (int j = 0; j < n; j++) {
                        if (mapByRow[j].count(color)) {
                            mapByRow[j][color]--;
                            if (mapByRow[j][color] == 0) {
                                mapByRow[j].erase(color);
                            }
                        }
                    }
                    break;
                }
            }
        }

        ans.emplace_back(type, number + 1, color);
    }

    std::reverse(ans.begin(), ans.end());

    cout << ans.size() << "\n";
    for (const auto &item : ans) {
        cout << item << "\n";
    }

    return;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    solve();
  
    return 0;
}