def getnext(n):

    sm = int(n[::-1])+int(n)
    strsm= list(str(sm))
    strsm.sort()

    while '0' in strsm:
        strsm.remove('0')
    return ''.join(strsm)

def solve():
    # read 
    i, M, k = [int(i) for i in (input().split())]

    k=str(k)
    d={}
    d[k]=1

    m=1
    while(m<M):
        m+=1
        nxt= getnext(k)
        # check creeper
        if(nxt[:4]=='1233' and nxt[-3:]=='444'):
            print(i, 'C', m)
            return 
        if(nxt[:4]=='5566' and nxt[-4:]=='7777'):
            print(i, 'C', m)
            return
        if(nxt in d):
            print(i, 'R', m)
            return
        d[nxt]=1
        k=nxt

    print(i, k)
    return




t= int(input())
for i in range(t):
    solve()