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 JavaScript (node.js v5.12) (judge verdict: Time Limit Exceeded)

// inputに入力データ全体が入る
function Main(input) {
	// 1行目がinput[0], 2行目がinput[1], …に入る
	input = input.trim().split("\n");
	N = input[0]
	// var e = input[0].split(' ').map((n) => (parseInt(n)))[0]
	// var t = input[0].split(' ').map((n) => (parseInt(n)))[1]
	m = parseInt(input[1]) + 1
	for (i = 2; i <= m; i = i + 1) {
		// var q1 = parseInt(input[i].split(" ")[0])
		var qarr = input[i].split(" ")
		if (parseInt(qarr[0]) === 2) {
			if (parseInt(qarr[1]) === 1) {
				N = qarr[2] + N
			} else {
				N = N + qarr[2]
			}
		} else {
			if (input[i + 1] && parseInt(input[i + 1].split(" ")[0]) === 1 ) {
				i++
				continue
			} else  {
				N = rev(N)
			}
			// N = N.split('').reverse().join("")
		}
	}
	console.log(N)
}

function rev(s) {
  var rv = "";
  for (var i = 0, n = s.length; i < n; i = i + 1) {
    rv = rv + s[n - i - 1];
  }
  return rv;
}


	//出力
//*この行以降は編集しないでください（標準入出力から一度に読み込み、Mainを呼び出します）
Main(require("fs").readFileSync("/dev/stdin", "utf8"));
// Main(require('fs').readFileSync('./input.txt', 'utf-8'));