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 Kotlin (1.0.0) (judge verdict: Time Limit Exceeded)

import java.io.IOException
import java.lang.StringBuilder
import java.util.*

data class Query(val q: Int, val f: Int = 0, val c: String = "")

fun main(args: Array<String>) {
    class FastScanner {
        private val `in` = System.`in`
        private val buffer = ByteArray(1024)
        private var ptr = 0
        private var buflen = 0
        private fun hasNextByte(): Boolean {
            if (ptr < buflen) {
                return true
            } else {
                ptr = 0
                try {
                    buflen = `in`.read(buffer)
                } catch (e: IOException) {
                    e.printStackTrace()
                }

                if (buflen <= 0) {
                    return false
                }
            }
            return true
        }

        private fun readByte(): Int {
            return if (hasNextByte()) buffer[ptr++].toInt() else -1
        }

        private fun isPrintableChar(c: Int): Boolean {
            return c in 33..126
        }

        operator fun hasNext(): Boolean {
            while (hasNextByte() && !isPrintableChar(buffer[ptr].toInt())) ptr++
            return hasNextByte()
        }

        operator fun next(): String {
            if (!hasNext()) throw NoSuchElementException()
            val sb = StringBuilder()
            var b = readByte()
            while (isPrintableChar(b)) {
                sb.appendCodePoint(b)
                b = readByte()
            }
            return sb.toString()
        }

        fun nextLong(): Long {
            if (!hasNext()) throw NoSuchElementException()
            var n: Long = 0
            var minus = false
            var b = readByte()
            if (b == '-'.toInt()) {
                minus = true
                b = readByte()
            }
            if (b < '0'.toInt() || '9'.toInt() < b) {
                throw NumberFormatException()
            }
            while (true) {
                if ('0'.toInt() <= b && b <= '9'.toInt()) {
                    n *= 10
                    n += (b - '0'.toInt()).toLong()
                } else return if (b == -1 || !isPrintableChar(b)) {
                    if (minus) -n else n
                } else {
                    throw NumberFormatException()
                }
                b = readByte()
            }
        }

        fun nextInt(): Int {
            val nl = nextLong()
            if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw NumberFormatException()
            return nl.toInt()
        }

        fun nextDouble(): Double {
            return java.lang.Double.parseDouble(next())
        }
    }
    val sc = FastScanner()
    val s = sc.next()
    val q = sc.nextInt()
    val queries = (0 until q).map {
        val q = sc.next().toInt()
        if (q == 1) Query(q) else Query(q, sc.nextInt(), sc.next())
    }
    println(problem158d(s, q, queries))
}

fun problem158d(s: String, q: Int, queries: List<Query>): String {
    var sb = StringBuilder(s)
    var reverse = false
    for (i in 0 until q) {
        val qi = queries[i]
        if (qi.q == 1) {
            reverse = !reverse
        } else {
            if (qi.f == 1) {
                if (reverse) {
                    sb.append(qi.c)
                } else {
                    sb.insert(0,qi.c)
                }
            } else {
                if (reverse) {
                    sb.insert(0,qi.c)
                } else {
                    sb.append(qi.c)
                }
            }
        }
    }
    if (reverse) {
        sb = sb.reverse()
    }
    return sb.toString()
}