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: Time Limit Exceeded)

using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Text;

namespace MyProject
{
    class Program
    {
        static void Main(string[] args)
        {
#if Local
            var sw = new Stopwatch();
            sw.Start();
            Console.SetIn(new StreamReader("input.in"));
#endif

            var solver = new Solver();
            solver.Solve();
#if Local
            Console.WriteLine($"{sw.ElapsedMilliseconds}ms");
#endif
        }
    }

    class Node
    {
        public Node Parent { get; set; }
        public Node Child { get; set; }
        public char Value { get; set; }

        public Node(char val)
        {
            this.Value = val;
        }

        public Node AddParent(char val)
        {
            var node = new Node(val);
            node.Child = this;
            this.Parent = node;
            return node;
        }

        public Node AddChild(char val)
        {
            var node = new Node(val);
            node.Parent = this;
            this.Child = node;
            return node;
        }

        public override string ToString()
        {
            return new string(this.Value, 1);
        }
    }

    class Solver
    {
        public Node TopNode { get; set; }
        public Node LastNode { get; set; }

        public void Solve()
        {
            var S = Console.ReadLine();
            this.TopNode = null;
            foreach (var c in S)
            {
                if (this.TopNode == null)
                {
                    this.TopNode = new Node(c);
                    this.LastNode = this.TopNode;
                }
                else
                {
                    this.LastNode = this.LastNode.AddChild(c);
                }
            }

            var Q = int.Parse(Console.ReadLine());
            var isReverse = false;
            foreach (var i in Enumerable.Range(0, Q))
            {
                var item = Console.ReadLine().Split();
                var type = item[0];
                if (type == "1")
                {
                    isReverse ^= true;
                }
                else
                {
                    var F = item[1];
                    var C = item[2];
                    if (!isReverse && F == "1" ||
                        isReverse && F == "2")
                    {
                        // 先頭に追加
                        this.TopNode = this.TopNode.AddParent(C[0]);
                    }
                    else
                    {
                        // 末尾に追加
                        this.LastNode = this.LastNode.AddChild(C[0]);
                    }
                }
            }

            string answer = string.Empty;
            var node = this.TopNode;
            while (node != null)
            {
                answer += node.Value;
                node = node.Child;
            }

            if (isReverse)
            {
                answer = new string(answer.Reverse().ToArray());
            }

            Console.WriteLine(answer);
        }
    }
}