#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define all(n)  n.begin(),n.end()
#define sz(n) (ll) n.size()
#define endl '\n'
const double PI = 3.14159265358979323846;
const ll mod = 1e9 + 7;


void test_case() {
    string s;
    cin >> s;
    deque<char> dq;
    for (ll i=0; i<sz(s); i++) dq.push_back(s[i]);
    ll q;
    cin >> q;
    bool check = true;
    while(q--) {
        ll x,d;
        cin >> x;
        if (x == 1) {
            check = !check;
        }
        else {
            cin >> d;
            char c;
            cin >> c;
            if (d == 1) {
                if (check) dq.push_front(c);
                else dq.push_back(c);
            } else {
                if (check) dq.push_back(c);
                else dq.push_front(c);
            }
        }
    }
    if (check) {
        for (auto &x: dq) cout << x << ' ';
    } else {
        while(!dq.empty()) {
            cout << dq.back();
            dq.pop_back();
        }
    }
    cout << endl;
}

int32_t main() {
    //freopen("input.txt","r", stdin);
    //freopen("output.txt","w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ll t = 1;
    cin >> t;
    while(t--) {
        test_case();
    }
}