#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"

int cycle_lcm(vector<int> p){
    int n = p.size();
    int ret = 1;
    vector<bool> done(n,false);
    rep(i,n){
        if (done[i]) continue;
        int cur = i;
        int len = 0;
        while (!done[cur]){
            len++;
            done[cur] = true;
            cur = p[cur];
        }
        ret = lcm(ret, len);
    }
    return ret;
}

void solve(){
    int n, k; in(n,k);
    auto proc_row = [&](const vector<vector<int>> &a, int i){
        vector<vector<int>> b(n);
        rep(j,n){
            b[a[i][j]] = a[j];
        }
        return b;
    };
    auto transpose = [&](const vector<vector<int>> &a){
        vector<vector<int>> b(n,vector<int>(n));
        rep(i,n) rep(j,n){
            b[i][j] = a[j][i];
        }
        return b;
    };
    auto proc_col = [&](const vector<vector<int>> &a, int j){
        return transpose(proc_row(transpose(a), j));
    };
    vector<vector<int>> a(n,vector<int>(n)), b(n,vector<int>(n)); in(a,b);
    rep(i,n) rep(j,n) --a[i][j], --b[i][j];
    vector<pii> ops;
    vector<pii> atob;
    auto dfs = [&](auto sfs, vector<vector<int>> cur, int t) -> void {
        if (!atob.empty()) return ;
        if (t == k){
            if (cur == b){
                atob = ops;
            }
            return ;
        }
        rep(i,n){
            ops.emplace_back(0,i);
            sfs(sfs,proc_row(cur, i), t+1);
            ops.pop_back();
            if (!atob.empty()) return ;
        }
        rep(i,n){
            ops.emplace_back(1,i);
            sfs(sfs,proc_col(cur, i), t+1);
            ops.pop_back();
            if (!atob.empty()) return ;
        }
    };
    dfs(dfs,a,0);
    assert(ssize(atob) == k);
    vector<tuple<int,int,int>> atob_key_many;
    {
        auto aa = a;
        // out(aa); out();
        for (auto [q, i] : atob){
            if (q == 0){
                atob_key_many.push_back({q, aa[i][0], cycle_lcm(aa[i])});
                aa = proc_row(aa, i);
            }
            else {
                atob_key_many.push_back({q, aa[0][i], cycle_lcm([&]{
                    vector<int> p(n);
                    rep(j,n) p[j] = aa[j][i];
                    return p;
                }())});
                aa = proc_col(aa, i);
            }
            // out(aa); out();
        }
        // out("-------------------");
        assert(aa == b);
    }
    vector<pii> ans;
    auto bb = b;
    for (auto [q, key, many] : atob_key_many | views::reverse){
        // out(many);
        if (q == 0){
            rep(t,many-1){
                int j = [&]{
                    rep(jj,n){
                        if (bb[jj][0] == key){
                            return jj;
                        }
                    }
                    return -1;
                }();
                assert(j != -1);
                ans.emplace_back(q, j);
                bb = proc_row(bb, j);
            }
        }
        else {
            rep(t,many-1){
                int j = [&]{
                    rep(jj,n){
                        if (bb[0][jj] == key){
                            return jj;
                        }
                    }
                    return -1;
                }();
                assert(j != -1);
                ans.emplace_back(q, j);
                bb = proc_col(bb, j);
            }
        }
        // out(bb);
        // out();
    }
    // cout << flush;
    assert(bb == a);
    out(ans.size());
    for (auto [q, i] : ans){
        out(q == 0 ? 'R' : 'C', i+1);
    }
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}