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.Text;
using System.Collections.Generic;
using static System.Math;
using System.Linq;
using static System.Array;

namespace DigitsParades
{

    class Programk
    {
        static void Main(string[] args)
        {
            var S = Console.ReadLine().ToCharArray();
            var deque = new deque();
            for (int i = 0; i < S.Length; i++)
            {
                deque.push_back(S[i]);
            }
            var Q = long.Parse(Console.ReadLine());

            var flag = true;
            for (int i = 0; i < Q; i++)
            {
                var query = Console.ReadLine().Split(' ').Select(x => Convert.ToChar(x)).ToArray();
                if (query[0] == '1')
                {
                    flag = !flag;
                }
                else
                {
                    if (flag)
                    {
                        if (query[1] == '1')
                        {
                            //one.Insert(0, query[2]);
                            //S.Insert(0, query[2]);
                            deque.push_front(query[2]);
                            //one = string.Concat(query[2], one);
                        }
                        else
                        {
                            //two =string.Concat(two,query[2]);
                            //two.Append(query[2]);
                            deque.push_back(query[2]);
                            //S.Add(query[2]);
                        }

                    }
                    else
                    {
                        if (query[1] == '2')
                        {
                            //one.Insert(0, query[2]);
                            //one = string.Concat(query[2], one);
                            //S.Insert(0, query[2]);
                            deque.push_front(query[2]);
                        }
                        else
                        {
                            //two.Append(query[2]);
                            //two = string.Concat(two, query[2]);
                            //S.Add(query[2]);
                            deque.push_back(query[2]);
                        }
                    }
                }
            }
                if (flag)
                {
                    //Console.WriteLine(new String(S.ToArray()));
                    Console.WriteLine(String.Join("",deque.ReturnS()));
                }
                else
                {
                    char[] ar = deque.ReturnS();
                    Reverse(ar);
                    Console.WriteLine(String.Join("", ar));
                    //Console.WriteLine();
                }
        }
    }

    class deque
    {
        private int SIZE = 1000000;
        private char[] array;
        private int rear = 500001;
        private int front= 500000;

        public deque()
        {
            this.array = new char[this.SIZE];
        }

        public void push_back(char data)
        {
            if (rear == front)
            {
                return;
            }

            array[rear] = data;
            rear = (rear + 1) % SIZE;
        }

        public void push_front(char data)
        {
            if(rear == front)
            {
                return;
            }

            array[front] = data;
            front = (front - 1) % SIZE;
        }

        public char[] ReturnS()
        {
            //var res = new char[rear-front-1];
            var res = array.Skip(front+1).Take(rear - front - 1).ToArray();
            //Array.Copy(array, front - 1, res, 0, rear - front-1);
            return res;
        }
    }
    #region スキャナー
    class Scanner
    {
        public Scanner()
        {
            _pos = 0;
            _line = new string[0];
        }

        const char Separator = ' ';
        private int _pos;
        private string[] _line;

        #region スペース区切りで取得

        public string Next()
        {
            if (_pos >= _line.Length)
            {
                _line = Console.ReadLine().Split(Separator);
                _pos = 0;
            }

            return _line[_pos++];
        }

        public int NextInt()
        {
            return int.Parse(Next());
        }

        public long NextLong()
        {
            return long.Parse(Next());
        }

        public double NextDouble()
        {
            return double.Parse(Next());
        }

        #endregion

        #region 型変換

        private int[] ToIntArray(string[] array)
        {
            var result = new int[array.Length];
            for (int i = 0; i < array.Length; i++)
            {
                result[i] = int.Parse(array[i]);
            }

            return result;
        }

        private long[] ToLongArray(string[] array)
        {
            var result = new long[array.Length];
            for (int i = 0; i < array.Length; i++)
            {
                result[i] = long.Parse(array[i]);
            }

            return result;
        }

        private double[] ToDoubleArray(string[] array)
        {
            var result = new double[array.Length];
            for (int i = 0; i < array.Length; i++)
            {
                result[i] = double.Parse(array[i]);
            }

            return result;
        }

        #endregion

        #region 配列取得

        public string[] Array()
        {
            if (_pos >= _line.Length)
                _line = Console.ReadLine().Split(Separator);

            _pos = _line.Length;
            return _line;
        }

        public int[] IntArray()
        {
            return ToIntArray(Array());
        }

        public long[] LongArray()
        {
            return ToLongArray(Array());
        }

        public double[] DoubleArray()
        {
            return ToDoubleArray(Array());
        }

        #endregion
    }
    #endregion  

}