Problem:
Score : 400 points

Problem Statement

Takahashi has a string S consisting of lowercase English letters.

Starting with this string, he will produce a new one in the procedure given as follows.

The procedure consists of Q operations. In Operation i (1 \leq i \leq Q), an integer T_i is provided, which means the following:

If T_i = 1: reverse the string S.

If T_i = 2: An integer F_i and a lowercase English letter C_i are additionally provided.

If F_i = 1 : Add C_i to the beginning of the string S.

If F_i = 2 : Add C_i to the end of the string S.

Help Takahashi by finding the final string that results from the procedure.

Constraints

1 \leq |S| \leq 10^5

S consists of lowercase English letters.

1 \leq Q \leq 2 \times 10^5

T_i = 1 or 2.

F_i = 1 or 2, if provided.

C_i is a lowercase English letter, if provided.

Input

Input is given from Standard Input in the following format:

S
Q
Query_1
:
Query_Q

In the 3-rd through the (Q+2)-th lines, Query_i is one of the following:

1

which means T_i = 1, and:

2 F_i C_i

which means T_i = 2.

Output

Print the resulting string.

Sample Input 1

a
4
2 1 p
1
2 2 c
1

Sample Output 1

cpa

There will be Q = 4 operations. Initially, S is a.

Operation 1: Add p at the beginning of S. S becomes pa.

Operation 2: Reverse S. S becomes ap.

Operation 3: Add c at the end of S. S becomes apc.

Operation 4: Reverse S. S becomes cpa.

Thus, the resulting string is cpa.

Sample Input 2

a
6
2 2 a
2 1 b
1
2 2 c
1
1

Sample Output 2

aabc

There will be Q = 6 operations. Initially, S is a.

Operation 1: S becomes aa.

Operation 2: S becomes baa.

Operation 3: S becomes aab.

Operation 4: S becomes aabc.

Operation 5: S becomes cbaa.

Operation 6: S becomes aabc.

Thus, the resulting string is aabc.

Sample Input 3

y
1
2 1 x

Sample Output 3

xy

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<iostream>
#include<iomanip>
#include<limits>
#include<string>
#include<vector>
#include<algorithm>
#include<stdio.h>
#include<cmath>


using namespace std;

typedef unsigned long long ull;
typedef long long ll;

#define big ((ll)(1e9)+7)


// double c(double x)
// {
//   double X = x;
//   X = int(X) % 10;
//   return X;
// }

int main()
{
  char s;
  cin >> s;
  ll q;
  cin >> q;
  vector<int> num(q);
  vector<int> f(q);
  vector<char> c(q);
  for(ll i = 0;i < q;i++)
  {
    cin >> num[i];
    if(num[i] == 1)
    {
      f[i] = -1;
      c[i] = 'A';
    }
    else
    {
      cin >> f[i] >> c[i];
    }
  }
  vector<char> first;
  vector<char> last;
  // first.push_back(s);
  for(ll i = 0;i < q;i++)
  {
    // for(ll j = first.size()-1;j >=0;j--)
    // {
    //   cout << first[j];
    // }
    // cout << s;
    // for(ll j = 0;j < last.size();j++)
    // {
    //   cout << last[j];
    // }
    // cout << endl;
    if(num[i] == 2)
    {
      if(f[i] == 1)
      {
        first.push_back(c[i]);
      }
      else if(f[i] == 2)
      {
        last.push_back(c[i]);
      }
      if(first.size() != last.size())
      {
        if(first.size() < last.size())
        {
          for(int i = 0;i < (last.size()-first.size())/2;i++)
          {
            first.insert(first.begin(),s);
            s = last[0];
            last.erase(last.begin());
          }
        }
        else if(first.size() > last.size())
        {
          for(int i = 0;i < (first.size()-last.size())/2;i++)
          {
            last.insert(last.begin(),s);
            s = first[0];
            first.erase(first.begin());
          }
        }
      }
    }
    else
    {
      if((first.size()+last.size())%2 == 0 && first.size() != 0 && last.size() != 0)
      {
        char tmp;
        for(ll i = 0;i < first.size();i++)
        {
          tmp = first[i];
          first[i] = last[i];
          last[i] = tmp;
        }
      }
      else
      {
        if(first.size() < last.size())
        {
          first.insert(first.begin(),s);
          char tmp;
          for(ll i = 0;i < first.size();i++)
          {
            tmp = first[i];
            first[i] = last[i];
            last[i] = tmp;
          }
          s = last[0];
          last.erase(last.begin());
        }
        else
        {
          last.insert(last.begin(),s);
          char tmp;
          for(ll i = 0;i < first.size();i++)
          {
            tmp = first[i];
            first[i] = last[i];
            last[i] = tmp;
          }
          s = first[0];
          first.erase(first.begin());
        }
      }
    }
  }
  for(ll i = first.size()-1;i >=0;i--)
  {
    cout << first[i];
  }
  cout << s;
  for(ll i = 0;i < last.size();i++)
  {
    cout << last[i];
  }
  cout << endl;
}