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 Rust (1.15.1) (judge verdict: Accepted)

// This code is generated by [cargo-atcoder](https://github.com/tanakh/cargo-atcoder)
// Original source code:
/*
// #[macro_use]
// mod utils {
//     macro_rules! input {
//         ($($r:tt)*) => {
//             let stdin = std::io::stdin();
//             let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
//             let mut next = move || -> String{
//                 bytes
//                     .by_ref()
//                     .map(|r|r.unwrap() as char)
//                     .skip_while(|c|c.is_whitespace())
//                     .take_while(|c|!c.is_whitespace())
//                     .collect()
//             };
//             input_inner!{next, $($r)*}
//         };
//     }
//     macro_rules! input_inner {
//         ($next:expr) => {};
//         ($iter:expr, ) => {};

//         ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
//             let $var = read_value!($next, $t);
//             input_inner!{$next $($r)*}
//         };
//         ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
//             let mut $var = read_value!($next, $t);
//             input_inner!{$next $($r)*}
//         };
//         ($next:expr, _ : $t:tt $($r:tt)*) => {
//             let _ = read_value!($next, $t);
//             input_inner!{$next $($r)*}
//         };
//     }
//     macro_rules! read_value {
//         ($next:expr, ( $($t:tt),* )) => {
//             ( $(read_value!($next, $t)),* )
//         };
//         ($next:expr, [ $t:tt ; $len:expr ]) => {
//             (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
//         };
//         ($next:expr, chars) => {
//             read_value!($next, String).chars().collect::<Vec<char>>()
//         };
//         ($next:expr, usize1) => {
//             read_value!($next, usize) - 1
//         };
//         ($next:expr, $t:ty) => {
//             $next().parse::<$t>().expect("Parse error")
//         };
//     }
// }

use std::collections::VecDeque;
fn main() {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).unwrap();
    s = s.trim_end().to_owned();
    let mut s = s.chars().collect::<VecDeque<_>>();

    let mut sl = String::new();
    std::io::stdin().read_line(&mut sl).unwrap();
    sl = sl.trim_end().to_owned();
    let q: usize = sl.parse().unwrap();

    let mut flip = false;
    for _ in 0..q {
        let mut sl = String::new();
        std::io::stdin().read_line(&mut sl).unwrap();
        let mut sl = sl.split_whitespace();
        let t: usize = sl.next().unwrap().trim_end().parse().unwrap();

        if t == 1 {
            flip = !flip;
        } else {
            let f: i32 = sl.next().unwrap().trim_end().parse().unwrap();
            let c: char = sl.next().unwrap().trim_end().parse().unwrap();

            if (f == 1 && flip) || (f == 2 && !flip) {
                s.push_back(c);
            } else {
                s.push_front(c);
            }
        }
    }

    if flip {
        for c in s.iter().rev() {
            print!("{}", c);
        }
    } else {
        for c in s {
            print!("{}", c);
        }
    }
}
*/

fn main() {
    let exe = "/tmp/bin5C175C36";
    std::io::Write::write_all(&mut std::fs::File::create(exe).unwrap(), &decode(BIN)).unwrap();
    std::fs::set_permissions(exe, std::os::unix::fs::PermissionsExt::from_mode(0o755)).unwrap();
    std::process::exit(std::process::Command::new(exe).status().unwrap().code().unwrap())
}

fn decode(v: &str) -> Vec<u8> {
    let mut ret = vec![];
    let mut buf = 0;
    let mut tbl = vec![64; 256];
    for i in 0..64 { tbl[TBL[i] as usize] = i as u8; }
    for (i, c) in v.bytes().filter_map(|c| { let c = tbl[c as usize]; if c < 64 { Some(c) } else { None } }).enumerate() {
        match i % 4 {
            0 => buf = c << 2,
            1 => { ret.push(buf | c >> 4); buf = c << 4; }
            2 => { ret.push(buf | c >> 2); buf = c << 6; }
            3 => ret.push(buf | c),
            _ => unreachable!(),
        }
    }
    ret
}

const TBL: &'static [u8] = b"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
const BIN: &'static str = "<base64-encoded ELF executable removed>";