#include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <cstring>
using namespace std;

#define MAX_LENGTH 128
#define COUNT_OF_PARENTHESE 4

class God_sohyun{
    char priority[COUNT_OF_PARENTHESE];
    stack<int> s_storage;
    queue<char> input;
    vector<char> v_result;
public:
    God_sohyun(char _input[MAX_LENGTH], char _priority[COUNT_OF_PARENTHESE] ) {
        string str(_input);
        for(int i=0; i<str.size(); i++)
            input.push(str[i]);
        for(int i=0; i<COUNT_OF_PARENTHESE; i++)
            priority[i] = _priority[i];
    }
    char get_pair(char c){
        switch(c){
        case ')':
            return '(';
        case '}':
            return '{';
        case ']':
            return '[';
        case '>':
            return '<';
        }
        return -1;
    }
    //왼쪽 괄호만 넘겨야함
    //리턴은 오른쪽 괄호로 넘겨서 get_pair를 쓸 수 있도록 취함
    char get_higher_priority(char left, char right){
        char ch;
        for(int i=0; i<COUNT_OF_PARENTHESE; i++){
            if(priority[i] == left || priority[i] == right ){
                ch = priority[i]; break;
            }
        }
        switch(ch){
        case '(':
            return ')';
        case '{':
            return '}';
        case '[':
            return ']';
        case '<':
            return '>';
        }
    }
    void run(){
        char ch;

        while( input.size() > 0 && (ch = input.front())){
            v_result.push_back(ch);
            input.pop();

            switch(ch){
            case '(':case '{':case '[':case '<':
                s_storage.push(v_result.size()-1);              
                break;
            case ')':case '}':case ']':case '>':
                if( s_storage.size() == 0 || v_result[(s_storage.top())] != get_pair(ch) ){
                    char higher = get_higher_priority(v_result[(s_storage.top())], get_pair(ch));
                    if(ch == higher){
                        v_result[(s_storage.top())] = get_pair(higher);
                        s_storage.pop();
                    }else{
                        v_result.at(v_result.size()-1) = higher;
                    }
                }else{
                    s_storage.pop();
                }
                break;      
            }
        }
        for(int i=0; i<v_result.size(); i++){
            cout<<v_result[i];
        }
        cout<<endl;
    }

};

int main(){
    vector<God_sohyun> v;
    int testcases;
    cin>>testcases;

    for(int i=0; i<testcases; i++){
        char input[MAX_LENGTH], _priority[COUNT_OF_PARENTHESE+1];
        cin>>input>>_priority;
        v.push_back(*(new God_sohyun(input, _priority)));
    }

    for(int i=0; i<v.size(); i++){
        v[i].run();
    }
    return 0;
}