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 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <stdlib.h>
struct node {
  char c;
  struct node *next;
  struct node *prev;
};
struct list {
  struct node *first;
  struct node *last;
  int num;
};

void insert_first(struct list *list, char c) {
  struct node *new_node = malloc(sizeof(struct node));
  new_node->c = c;
  if (list->num == 0) {
    new_node->next = NULL;
    new_node->prev = NULL;
    list->first = new_node;
    list->last = new_node;
    list->num++;
  } else {
    new_node->next = list->first;
    new_node->prev = NULL;
    list->first = new_node;
    list->num++;
  }
}

void insert_last(struct list *list, char c) {
  struct node *new_node = malloc(sizeof(struct node));
  new_node->c = c;
  if (list->num == 0) {
    new_node->next = NULL;
    new_node->prev = NULL;
    list->first = new_node;
    list->last = new_node;
    list->num++;
  } else {
    //printf("p %p %p %p %d\n", list, list->first, list->last, list->num);
    new_node->prev = list->last;
    new_node->next = NULL;
    list->last = new_node;
    list->num++;
    //printf("p %p %p %p %d\n", list, list->first, list->last, list->num);
  }
}


void print_list(struct list *list) {
  struct node *node = list->first;
  for (int i = 0; node != NULL; i++) {
    //printf("%p node\n", node);
    putchar(node->c);
    node = node->next;
  }
  putchar(10);
}

void print_list_rev(struct list *list) {
  struct node *node = list->last;
  for (int i = 0; node != NULL; i++) {
    //printf("%p node\n", node);
    putchar(node->c);
    node = node->prev;
  }
  putchar(10);
}

int main(){
  char s[100001];
  scanf("%s", s);
  struct list *s_list = malloc(sizeof(struct list));
  s_list->first = NULL;
  s_list->last = NULL;
  s_list->num = 0;
  for(int i=0;i<100001;i++){
    if (s[i] != '\0') {
      insert_last(s_list, s[i]);
    } else {
      break;
    }
  }
  int rev = 0;
  int q;
  scanf("%d", &q);
  for(int i = 0; i < q; i++){
    int t;
    scanf("%d", &t);
    if (t == 1) {
      rev = 1 - rev;
    } else {
      int f;
      char c;
      scanf("%d %c\n", &f, &c);
      if (f - rev == 1) {
        insert_first(s_list, c);
      } else {
        insert_last(s_list, c);
      }
    }
  }
  if (rev == 0) {
    print_list(s_list);
  } else {
    print_list_rev(s_list);
  }
  return 0;
}