// 那就是希望。
// 即便需要取模，也是光明。

#include <algorithm>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b){return(b<a)?a=b,true:false;}
template<typename T>T lowbit(T n){return n&-n;}
template<typename T>T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T>T lcm(T a,T b){return(a!=0||b!=0)?a/gcd(a,b)*b:(T)0;}
template<typename T>T exgcd(T a,T b,T&x,T&y){if(b!=0){T ans=exgcd(b,a%b,y,x);y-=a/b*x;return ans;}else return y=0,x=1,a;}
template<typename T>T power(T base,T index,T mod)
{
    T ans=1%mod;
    while(index)
    {
        if(index&1)ans=ans*base%mod;
        base=base*base%mod,index>>=1;
    }
    return ans;
}
#ifdef MYEE
#define endA() return puts("a"),voi()
#define endB() return puts("b"),voi()
#define endC() return puts("c"),voi()
#else
#define endA() return puts("B"),voi()
#define endB() return puts("C"),voi()
#define endC() return puts("R"),voi()
#endif
voi solve(){
    uint n,a,b,m;scanf("%u%u%u",&n,&a,&b),m=a+b;
    std::vector<std::pair<uint,uint> >V(m),User;
    for(uint i=0;i<a;i++)scanf("%u",&V[i].first),V[i].first--;
    for(uint i=a;i<m;i++)scanf("%u",&V[i].first),V[i].first--,V[i].second=1;
    if(n==m)endB();
    std::inplace_merge(V.begin(),V.begin()+a,V.end());
    for(uint i=0,p=V[0].first;i<m;i++)V[i].first=(i==m-1?n+p:V[(i+1)%m].first)-V[i].first-1;
    bol op1=1,op2=0,op3=0,op4=0;
    for(uint i=0;op1&&i<m;i++)op1=V[i].second!=V[(i+1)%m].second;
    if(op1)endC();
    auto pre=[&](uint p,uint c=1){return(p+m-c%m)%m;};
    auto nxt=[&](uint p,uint c=1){return(p+c)%m;};
    for(uint i=0;i<m;i++)if(V[i].second==V[pre(i)].second){
        if(V[i].second==V[nxt(i)].second){User.push_back(V[i]);continue;}
        uint j=i,c=0,d=0;
        do d+=V[j].first,c++,j=nxt(j);while(V[j].second!=V[pre(j)].second);
        if(c&1)User.push_back({d,V[i].second}),User.push_back(V[pre(j)]);
        else{
            User.push_back(V[i]);
            for(uint t=nxt(i);nxt(t)!=j;t=nxt(t,2))
                User.push_back({0,V[t].second}),User.push_back({0,V[t].second}),
                User.push_back({0,V[nxt(t)].second}),User.push_back(V[nxt(t)]);
            User.push_back(V[pre(j)]);
        }
    }
    V=User,m=V.size();
    for(uint i=0;i<m;i++)if(V[i].second==V[nxt(i)].second&&V[i].second==V[nxt(i,2)].second){
        (V[i].second?op2:op1)=1;if(V[i].first||V[nxt(i)].first)(V[i].second?op4:op3)=1;
    }
    bol reved=0;
    if(op3&&op4)endC();
    if(op3&&!op2)endA();
    if(op4&&!op1)endB();
    if(op3&&op2){
        for(uint i=0;i<m;i++)if(!V[pre(i)].second&&V[i].second&&V[nxt(i)].second&&V[nxt(i,2)].second)
        {
            uint j=i;while(V[j].second)j=nxt(j);
            if(V[pre(j)].first){
                if(reved)endC();else reved=1;
                if(V[nxt(j)].second&&V[nxt(j,2)].second&&V[nxt(j,3)].second)endC();
            }
            if(V[pre(i)].first){
                if(reved)endC();else reved=1;
                if(V[pre(i,2)].second&&V[pre(i,3)].second&&V[pre(i,4)].second)endC();
            }
        }
        endA();
    }
    if(op4&&op1){
        for(uint i=0;i<m;i++)if(V[pre(i)].second&&!V[i].second&&!V[nxt(i)].second&&!V[nxt(i,2)].second)
        {
            uint j=i;while(!V[j].second)j=nxt(j);
            if(V[pre(j)].first||V[pre(i)].first)endC();
        }
        endB();
    }
    if(op1){
        std::vector<std::pair<uint,uint> >Wins;
        for(uint i=0;i<m;i++)if(V[pre(i)].second&&!V[i].second&&!V[nxt(i)].second&&!V[nxt(i,2)].second)
        {
            uint j=nxt(i,2);while(!V[j].second)j=nxt(j);
            if(V[pre(i)].first)Wins.push_back({i,j});
            if(V[pre(j)].first)Wins.push_back({i,j});
        }
        if(Wins.size()){
            if(!op2)endA();
            uint p=-1,w=0;
            for(uint i=0;i<m;i++)if(!V[pre(i)].second&&V[i].second&&V[nxt(i)].second&&V[nxt(i,2)].second){
                uint j=nxt(i,2);while(V[j].second)j=nxt(j);
                if(V[pre(j)].first){
                    if(reved||(V[nxt(j)].second&&V[nxt(j,2)].second&&V[nxt(j,3)].second))endC();
                    else reved=1,p=j,w=0;
                }
                if(V[pre(i)].first){
                    if(reved||(V[pre(i,2)].second&&V[pre(i,3)].second&&V[pre(i,4)].second))endC();
                    else reved=1,p=pre(i),w=1;
                }
            }
            if(!reved||Wins.size()>=2)endA();
            for(auto s:Wins)if(s.first==p||pre(s.second)==p)endA();
            if(w)V[pre(p)].first+=V[p].first,V[p].first=0;
            else V[p].first+=V[pre(p)].first,V[pre(p)].first=0;
            if(V[pre(Wins[0].first)].first)
                V[pre(Wins[0].first,2)].first+=V[pre(Wins[0].first)].first,V[pre(Wins[0].first)].first=0;
            else
                V[Wins[0].second].first+=V[pre(Wins[0].second)].first,V[pre(Wins[0].second)].first=0;
            uint v=0;
            for(uint t=0;t<m;t++)if(V[t].second!=V[nxt(t)].second)
                v^=V[t].first;
            if(v)endA();else endC();
        }
    }
    if(op2){
        for(uint i=0;i<m;i++)if(!V[pre(i)].second&&V[i].second&&V[nxt(i)].second&&V[nxt(i,2)].second){
            uint j=nxt(i,2);while(V[j].second)j=nxt(j);
            if(V[pre(j)].first){
                if(reved||(V[nxt(j)].second&&V[nxt(j,2)].second&&V[nxt(j,3)].second))endB();
                else reved=1,V[j].first+=V[pre(j)].first,V[pre(j)].first=0;
            }
            if(V[pre(i)].first){
                if(reved||(V[pre(i,2)].second&&V[pre(i,3)].second&&V[pre(i,4)].second))endB();
                else reved=1,V[pre(i,2)].first+=V[pre(i)].first,V[pre(i)].first=0;
            }
        }
    }
    uint v=0;
    for(uint t=0;t<m;t++)if(V[t].second!=V[nxt(t)].second)
        v^=V[t].first;
    if(v?!reved:reved)endA();else endB();
}
int main()
{
#ifdef MYEE
    freopen("QAQ.in","r",stdin);
    // freopen("QAQ.out","w",stdout);
#else
#endif
    uint t;scanf("%u",&t);
    while(t--)solve();
    return 0;
}

// 那就是希望。
// 即便需要取模，也是光明。