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
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
#include <bits/stdc++.h>

using namespace std;

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define reunique(v) v.resize(std::unique(v.begin(), v.end()) - v.begin())
#define sz(v) ((int)(v).size())

#define vec1d(x) vector<x>
#define vec2d(x) vector<vec1d(x)>
#define vec3d(x) vector<vec2d(x)>
#define vec4d(x) vector<vec3d(x)>

#define ivec1d(x, n, v) vec1d(x)(n, v)
#define ivec2d(x, n, m, v) vec2d(x)(n, ivec1d(x, m, v))
#define ivec3d(x, n, m, k, v) vec3d(x)(n, ivec2d(x, m, k, v))
#define ivec4d(x, n, m, k, l, v) vec4d(x)(n, ivec3d(x, m, k, l, v))

#define nl "\n"

#ifdef LOCAL
#include "pretty_print.hpp"
#define dbg(...) debug_out(__LINE__, #__VA_ARGS__, __VA_ARGS__)
#else
#define dbg(...) 42
#endif

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;

template <typename T> T sqr(T x) { return x * x; }
template <typename T> T abs(T x) { return x < 0? -x : x; }
template <typename T> T gcd(T a, T b) { return b? gcd(b, a % b) : a; }
template <typename T> bool chmin(T &x, const T& y) { if (x > y) { x = y; return true; } return false; }
template <typename T> bool chmax(T &x, const T& y) { if (x < y) { x = y; return true; } return false; }

auto random_address = [] { char *p = new char; return (uint64_t) p; };
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count() * (random_address() | 1));
mt19937_64 rngll(chrono::steady_clock::now().time_since_epoch().count() * (random_address() | 1));


int main(int /* argc */, const char** /* argv */)
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
#ifdef LOCAL
    assert(freopen("i.txt", "r", stdin));
    assert(freopen("o.txt", "w", stdout));
#endif

    int K = 26;
    int n, m;
    cin >> n >> m;
    auto rows = ivec2d(int, n, K, 0);
    auto cols = ivec2d(int, m, K, 0);
    auto a = ivec2d(int, n, m, 0);
    for (int i = 0; i < n; ++i) {
        string s;
        cin >> s;
        for (int j = 0; j < m; ++j) {
            int x = s[j] - 'A';
            a[i][j] = x;
            ++rows[i][x];
            ++cols[j][x];
        }
    }

    auto u_rows = ivec1d(int, n, 0);
    auto u_cols = ivec1d(int, m, 0);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < K; ++j) {
            if (rows[i][j] > 0) {
                ++u_rows[i];
            }
        }
    }
    for (int j = 0; j < m; ++j) {
        for (int i = 0; i < K; ++i) {
            if (cols[j][i] > 0) {
                ++u_cols[j];
            }
        }
    }

    queue<tuple<int, int>> q;
    for (int i = 0; i < n; ++i) {
        if (u_rows[i] == 1) {
            q.push({i, 0});
        }
    }
    for (int j = 0; j < m; ++j) {
        if (u_cols[j] == 1) {
            q.push({j, 1});
        }
    }

    vector<tuple<char, int, char>> ans;

    while (q.size()) {
        auto [x, t] = q.front();
        q.pop();

        int v = -1;
        while (v < K && ((t == 0 && rows[x][v] == 0) || (t == 1 && cols[x][v] == 0))) {
            ++v;
        }
        if (v == K) {
            continue;
        }

        ans.push_back({t == 0? 'R' : 'K', x, (char)('A' + v)});

        if (t == 0) {
            u_rows[x] = -1;
            for (int j = 0; j < m; ++j) {
                if (a[x][j] == v) {
                    a[x][j] = -1;
                    if (--cols[j][v] == 0) {
                        if (--u_cols[j] == 1) {
                            q.push({j, 1});
                        }
                    }
                }
            }
        } else {
            u_cols[x] = -1;
            for (int i = 0; i < n; ++i) {
                if (a[i][x] == v) {
                    a[i][x] = -1;
                    if (--rows[i][v] == 0) {
                        if (--u_rows[i] == 1) {
                            q.push({i, 0});
                        }
                    }
                }
            }
        }
    }

    cout << ans.size() << nl;

    reverse(all(ans));
    for (auto& [t, x, c] : ans) {
        cout << t << " " << x + 1 << " " << c << nl;
    }

#ifdef LOCAL
    cerr << "Time execute: " << clock() / (double)CLOCKS_PER_SEC << " sec" << endl;
#endif
    return 0;
}