#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1000000007;
#define sz(x) (ll)(x).size()
#define rd ({ll x; cin >> x; x; })
#define dbg(x) cerr << "[" #x "]  " << (x) << "\n\n"
// #define errv(x) {cerr << "["#x"]  ["; for (const auto& ___ : (x)) cerr << ___ << ", "; cerr << "]\n";}
// #define errvn(x, n) {cerr << "["#x"]  ["; for (auto ___ = 0; ___ < (n); ++___) cerr << (x)[___] << ", "; cerr << "]\n";}
// #define cerr if(0)cerr
#define xx first
#define yy second
mt19937 rnd(std::chrono::high_resolution_clock::now().time_since_epoch().count());
/*_________________________________________________________________________________________________________________________*/

void Solve()
{
    string a;
    cin >> a;
    string lr[2];
    ll q;
    cin >> q;
    bool which = 0;
    while (q--) {
        ll qr;
        cin >> qr;
        if (qr == 1) {
            which ^= 1;
            continue;
        }
        ll d;
        cin >> d;
        char c;
        cin >> c;
        if (d == 2) {
            ll end = 1;
            if (which) {
                end = 0;
            }
            lr[end] += c;
        } else {
            ll end = 0;
            if (which) {
                end = 1;
            }
            lr[end] += c;
        }
    }
    if (!which) {
        reverse(lr[0].begin(), lr[0].end());
        cout << lr[0] << a << lr[1] << "\n";
    } else {
        reverse(lr[1].begin(), lr[1].end());
        reverse(a.begin(), a.end());
        cout << lr[1] << a << lr[0] << "\n";
    }
}

int32_t main()
{
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    cin >> t;
    for (int i = 1; i <= t; i++) {
        // cout << "Case #" << i << ": "; // cout << "Case " << i << ": ";
        Solve();
    }
    return 0;
}
// Coded by Tahsin Arafat (@TahsinArafat)