package hello;

import java.util.Arrays;
import java.util.Scanner;
import java.util.Stack;

public class PatternMatch {
    public static void main(String[] args){
        Scanner input = new Scanner(System.in);

        int repeat = 0;

        Stack<Character> open = new Stack<>();

        repeat = input.nextInt();

        input.skip("[\\r\\n]+");  

        while(repeat --> 0){
            open.clear();

            String[] buf = input.nextLine().split(" ");
            char[] data = buf[0].toCharArray();
            char[] priority = buf[1].toCharArray();
            char[] result = new char[data.length];

            int stackCount = 0;

            for(int i=0,n=data.length;i<n;i++){
                if(openTag(data[i])){   // openTag일 때
                    result[i] = (data[i]);
                    open.push(data[i]);
                    stackCount = i;
                }else if(closeTag(open.peek(),data[i])){ // closeTag면서 매치가 되었을 때
                    result[i] = (data[i]);
                    open.pop();
                    stackCount -= 1;
                }else{  //closeTag 매치가 안되었을 떄
                    stackCount = matchTag(result, priority, open.peek(), data[i], stackCount,i);
                    open.pop();
                }
            }

            for(int i=0;i<result.length;i++){
                System.out.print(result[i]);
            }
            System.out.println();

        }// while
    }// main


    public static boolean openTag(char ch){
         if(ch == '(' || ch == '{' || ch == '[' ||ch == '<'){
             return true;
         }

         return false;
    }

    public static boolean closeTag(Character open,char ch){
        switch(ch){
        case ')':
            return open.equals('(');
        case '}':
            return open.equals('{');
        case ']':
            return open.equals('[');
        case '>':
            return open.equals('<');
        default :
            return false;
        }    
    }

    public static char reverseTag(char ch,boolean plus){
        if(plus == true){
            if(ch == '('){
                ch += 1;
                return ch;
            }

            ch += 2;

        }else if(plus == false){
            if(ch == ')'){
                ch -= 1;
                return ch;
            }

            ch -= 2;
        }

        return ch;
    }

    public static int matchTag(char[] result,char[] priority,Character open,Character ch,int openLocation,int closeLocation){
        Character reverseChar = reverseTag(ch, false);
        Character reverseOpen = reverseTag(open, true);

        int openPriority = 0;
        int chPriority = 0;

        for(int i=0;i<4;i++){   // 0이 가장 우선순위가 높음
            if(open.equals(priority[i])){
                openPriority = i;
            }

            if(reverseChar.equals(priority[i])){
                chPriority = i;
            }
        }

        if(openPriority > chPriority){  //ch의 우선순위가 높을 때  
            result[openLocation] = reverseChar;
            result[closeLocation] = ch;
        }else if(openPriority < chPriority){    //open의 우선순위가 높을 때
            result[closeLocation] = reverseOpen;
        }

        return openLocation-1;
    }


}// class