#include <iostream>
#include <vector>
#include <algorithm>
#include <deque>
#include <cstdio>
using namespace std;
int main(){
    int T;
    cin>>T;
    while(T--){
        //큐를 직접 뒤집지 말고, R마다 front, back 방향만 switching해주자
        int swit = 1;
        deque<int> dq;
        string a;
        cin>>a;
        int n;
        cin>>n;
        char trash;
        scanf("\n%c",&trash);
        for(int i=0;i<n;i++){
            int tmp;
            scanf("%d",&tmp);
            dq.push_back(tmp);
            scanf("%c",&trash);
        }
        if(n==0)
            scanf("%c",&trash);
        int flag=0;
        for(int i=0;i<a.size();i++){
            if(a[i]=='R'){
                if(swit)
                    swit=0;
                else
                    swit=1;
            }else if(a[i]=='D'){
                if(dq.empty()){
                    flag=1;
                    break;
                }
                if(swit)
                    dq.pop_front();
                else
                    dq.pop_back();
            }
        }
        //출력
        if(flag){
            cout<<"error"<<'\n';
        }else{
            cout<<'[';
            if(swit){
                if(!dq.empty()){
                    cout<<dq.front();
                    dq.pop_front();
                }
                while(!dq.empty()){
                    cout<<',';
                    cout<<dq.front();
                    dq.pop_front();
                }
            }
            else{
                if(!dq.empty()){
                    cout<<dq.back();
                    dq.pop_back();
                }
                while(!dq.empty()){
                    cout<<',';
                    cout<<dq.back();
                    dq.pop_back();
                }
            }
            cout<<']'<<'\n';
        }
    }
    return 0;
}