import sys # sys.setrecursionlimit(200005) # sys.set_int_max_str_digits(200005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] # inf = -1-(-1 << 31) inf = -1-(-1 << 62) # md = 10**9+7 # md = 998244353 from math import lcm def size(rep): fin=[0]*n l=1 for i in range(n): if fin[i]:continue s=0 while fin[i]==0: fin[i]=1 s+=1 i=rep[i] l=lcm(l,s) return l def dfs(toi,toj,cnt): if cnt: for i in range(n): rep=[0]*n ni=toi[i] for nj,a in zip(toj,aa[i]):rep[nj]=a if dfs([rep[t] for t in toi],toj,cnt-1): si,ni=ni,rep[ni] for _ in range(size(rep)-1): ans.append("R "+str(ni+1)) ni=rep[ni] return True for j in range(n): rep=[0]*n nj=toj[j] for i in range(n): ni=toi[i] rep[ni]=aa[i][j] if dfs(toi,[rep[t] for t in toj],cnt-1): sj, nj = nj, rep[nj] for _ in range(size(rep)-1): ans.append("C "+str(nj+1)) nj = rep[nj] return True return False for i in range(n): for j in range(n): ni=toi[i] nj=toj[j] if aa[i][j]!=bb[ni][nj]:return False return True n,k=LI() aa=LLI1(n) bb=LLI1(n) ans=[] dfs(list(range(n)),list(range(n)),k) print(len(ans)) print(*ans,sep="\n")