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# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Text.RegularExpressions;
using static System.Console;
using static System.Math;
using static MyIO;
using static MyUtil;

public class D
{
	public static void Main() => (new Solver()).Solve();
}

public class Solver
{
	public void Solve()
	{
		var S = GetString();
		int Q = GetInt();		
		var deque = new Deque<char>(S.Length + Q + 2);
		for(int i = 0; i < S.Length; i++)
			deque.PushBack(S[i]);
			
		bool rev = false;
		for(int i = 0; i < Q; i++)
		{
			if(GetInt() == 1)
			{
				rev ^= true;
			}
			else
			{
				int F = GetInt();
				char C = GetChar();
				if((F == 1) ^ rev)
					deque.PushFront(C);
				else
					deque.PushBack(C);
			}
		}

		var ans = new List<char>();
		if(rev)
		{
			while(deque.Count > 0)
				ans.Add(deque.PopBack());
		}
		else
		{
			while(deque.Count > 0)
				ans.Add(deque.PopFront());
		}
		WriteLine(new String(ans.ToArray()));
	}
}

public class Deque<T>
{
	private int N; 
	private T[] buf;
	private int front;
	private int back;

	public int Count => (front <= back) ? back - front : N - front + back;

	public Deque(int n)
	{
		N = n;
		buf = new T[N];
		front = 0;
		back = 0;
	}

	public void PushBack(T data)
	{
		if(Count == N)
			throw new Exception();

		buf[back] = data;
		back = inc(back);
	}

	public T PeekBack() => buf[dec(back)];

	public T PopBack()
	{
		if(Count == 0)
			throw new Exception();

		back = dec(back);
		return buf[back];
	}
	
	public void PushFront(T data)
	{
		if(Count == N)
			throw new Exception();

		front = dec(front);
		buf[front] = data;
	}

	public T PeekFront() => buf[front];

	public T PopFront()
	{
		if(Count == 0)
			throw new Exception();

		T res = buf[front];
		front = inc(front);
		return res;
	}

	private int inc(int x) => (x == N - 1) ? 0 : x + 1;
	private int dec(int x) => (x == 0) ? N - 1 : x - 1;
}

public static class MyIO
{
	private static string[] args = null;
	private static int num = -1;
	private static int used = -1;

	private static string getArg()
	{
		if(used == num)
		{
			args = Console.ReadLine().Split(' ');
			num = args.Length;
			used = 0;
		}
		return args[used++];
	}

	public static int GetInt() => int.Parse(getArg());
	public static long GetLong() => long.Parse(getArg());
	public static double GetDouble() => double.Parse(getArg());
	public static decimal GetDecimal() => decimal.Parse(getArg());
	public static string GetString() => getArg();
	public static char GetChar() => getArg()[0];
	public static int[] GetInts(long N) => Enumerable.Range(0, (int)N).Select(_ => GetInt()).ToArray();
	public static long[] GetLongs(long N) => Enumerable.Range(0, (int)N).Select(_ => GetLong()).ToArray();
	public static double[] GetDoubles(long N) => Enumerable.Range(0, (int)N).Select(_ => GetDouble()).ToArray();
	public static decimal[] GetDecimals(long N) => Enumerable.Range(0, (int)N).Select(_ => GetDecimal()).ToArray();
	public static string[] GetStrings(long N) => Enumerable.Range(0, (int)N).Select(_ => GetString()).ToArray();
}

public static class MyUtil
{
	public static void chmax<T>(ref T x, T y) where T : IComparable<T>
	{
		if(x.CompareTo(y) < 0)
			x = y;
	}

	public static void chmin<T>(ref T x, T y) where T : IComparable<T>
	{
		if(x.CompareTo(y) > 0)
			x = y;
	}

	public static void swap<T>(ref T x, ref T y)
	{
		T tmp = x;
		x = y;
		y = tmp;
	}
}