#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define ff first
#define ss second
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define f(i,x,y) for(int i=x;i<y;i++)
#define f2(i,x,y) for(int i=x;i>=y;i--)
#define pii pair<int,int>
#define Fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const int MOD =1000000007;
const int INF = 1e18;
const int N = 2e5;
 
void solve(int tc){
    deque<char>d;
    string s; cin >> s;
    for(auto it : s)d.push_back(it);
    int rev = 0;
    int q; cin >> q;
    while(q--){
        int t; cin >> t;
        if(t==1)rev = 1 - rev;
        else{
            int dd;char c; cin >> dd >> c;
            if(rev==0){
                if(dd==1)d.push_front(c);
                else d.push_back(c);
            }
            else {
                if(dd==2)d.push_front(c);
                else d.push_back(c);
            }
        }
    }
    if(rev==0){
        while(!d.empty()){
            cout << d.front();
            d.pop_front();
        }
    }
    else{
        while(!d.empty()){
            cout << d.back();
            d.pop_back();
        }
    }
}
int32_t main(){

    Fast

    int t=1;

    cin >> t;

    for(int tc=1;tc<=t;tc++){

        solve(tc);
    }
    return 0;
}