#include <iostream>
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define pb push_back
#define vi vector<int>
#define vll vector<ll>
#define mp make_pair
#define pq priority_queue<int>
#define pi pair<int, int>
#define pll pair<ll, ll>
#define all(x) (x).begin(), (x).end()
#define f(i, n) for (int i = 0; i < n; i++)
#define PI acos(-1)
const int M = 1e9 + 7;
ll binExp(ll a, ll b)
{
    int res = 1;
    while (b)
    {
        if (b & 1)
            res = res * a;
        a *= a;
        b /= 2;
    }
    return res;
}
ll gcd(ll a, ll b)
{
    if (a == 0)
        return b;
    return gcd(b % a, a);
}
ll lcm(ll a, ll b)
{
    return (a / gcd(a, b)) * b;
}
ll sum(ll n)
{
    return n * (n + 1) / 2;
}
void solve()
{
    // abc
    // dabc
    // ea

    // cbad
    // cbade
    string s;
    cin >> s;
    int q;
    cin >> q;
    deque<char> v;
    for (auto &a : s)
        v.push_back(a);
    int f = 0;
    while (q--)
    {
        int ty;
        cin >> ty;
        if (ty == 1)
            f ^= 1;
        else
        {
            int i;
            cin >> i;
            char ch;
            cin >> ch;
            if (i == 1)
            {
                if (!f)
                    v.push_front(ch);
                else
                    v.push_back(ch);
            }
            else
            {
                if (f)
                    v.push_front(ch);
                else
                    v.push_back(ch);
            }
        }
    }
    if (f)
        reverse(all(v));
    for (auto &a : v)
        cout << a;
    cout << endl;
}
int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >> t;
    while (t--)
    {
        solve();
    }

    return 0;
}