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
#include <iostream>
#include <vector>
#include <string>
#include <numeric>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <tuple>

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

    int n, m;
    std::cin >> n >> m;

    char board[n][m];

    std::queue<std::pair<char, std::pair<int, char>>> toRemove;
    std::stack<std::pair<char, std::pair<int, char>>> ops;

    std::vector<std::map<char, int>> rows(n);
    std::vector<std::map<char, int>> cols(m);

    for (int i = 0; i < n; i++)
    {
        std::string row;
        std::cin >> row;
        for (int j = 0; j < m; j++)
        {
            board[i][j] = row[j];
            rows[i][row[j]]++;
            cols[j][row[j]]++;
        }
    }

    for (int i = 0; i < n; i++)
    {
        if (rows[i].size() == 1)
        {
            toRemove.push({'R', {i, rows[i].begin()->first}});
        }
    }

    for (int i = 0; i < m; i++)
    {
        if (cols[i].size() == 1)
        {
            toRemove.push({'K', {i, cols[i].begin()->first}});
        }
    }

    while (!toRemove.empty())
    {
        auto [t, p] = toRemove.front();
        ops.push({t, p});
        toRemove.pop();

        auto [r, c] = p;

        if (t == 'R')
        {
            for (int i = 0; i < m; i++)
            {
                if (board[r][i] == c)
                {
                    board[r][i] = ' ';
                    cols[i][c]--;

                    if (cols[i][c] == 0)
                    {
                        cols[i].erase(c);

                        if (cols[i].size() == 1)
                        {
                            toRemove.push({'K', {i, cols[i].begin()->first}});
                        }
                    }
                }
            }
        }
        else
        {
            for (int i = 0; i < n; i++)
            {
                if (board[i][r] == c)
                {
                    board[i][r] = ' ';
                    rows[i][c]--;

                    if (rows[i][c] == 0)
                    {
                        rows[i].erase(c);

                        if (rows[i].size() == 1)
                        {
                            toRemove.push({'R', {i, rows[i].begin()->first}});
                        }
                    }
                }
            }
        }
    }

    std::cout << ops.size() << std::endl;

    while (!ops.empty())
    {
        auto [t, p] = ops.top();
        ops.pop();

        std::cout << t << " " << p.first + 1 << " " << p.second << std::endl;
    }

    return 0;
}