Problem: For a dynamic list $L$ of integers, perform a sequence of the following operations. $L$ has a special element called END at the end of the list and an element of $L$ is indicated by a cursor.

* insert($x$): Insert $x$ before the element indicated by the cursor. After this operation, the cursor points the inserted element.
* move($d$): Move the cursor to the end by $d$, if $d$ is positive. Move the cursor to the front by $d$, if $d$ is negative.
* erase(): Delete the element indicated by the cursor. After this operation, the cursor points the element next to the deleted element. In case there is no such element, the cursor should point END.



In the initial state, $L$ is empty and the cursor points END.

Constraints

* $1 \leq q \leq 500,000$
* The cursor indicates an element of $L$ or END during the operations
* Erase operation will not given when the cursor points END
* $-1,000,000,000 \leq x \leq 1,000,000,000$
* Moving distance of the cursor ($\sum{|d|}$) does not exceed 1,000,000
* $L$ is not empty after performing all operations

Input

The input is given in the following format.


$q$
$query_1$
$query_2$
:
$query_q$


Each query $query_i$ is given by


0 $x$


or


1 $d$


or


2


where the first digits 0, 1 and 2 represent insert, move and erase operations respectively.

Output

Print all elements of the list in order after performing given operations. Print an element in a line.

Example

Input

5
0 1
0 2
0 3
1 1
2


Output

3
1

Solution (in CPP):

Solution:
#include <iostream>
#include <cstdio>

using namespace std;

class list
{
  struct node
  {
    int val;
    node* prev;
    node* next;
    node(int n) : val(n), prev(NULL), next(NULL) {}
    node(int n, node* prev_p, node* next_p) : val(n), prev(prev_p), next(next_p) {}
  };

  node* nil;
  node* cur;

public:
  list()
  {
    nil = new node(0);
    nil->prev = nil;
    nil->next = nil;
    cur = nil;
  }
  ~list() { clear(); }

  void insert(int val);
  void move(int d);
  void erase();
  void dump();
  void clear();
private:
  void moveForward(int d);
  void moveBackword(int d);
};

void list::insert(int val)
{
  // 新しいオブジェクトを作成する
  // 新しいオブジェクトのprevをcurのprevにする
  // 新しいオブジェクトのnextをcurにする
  node* newobj = new node(val, cur->prev, cur);

  // curのprevのnextを新しいオブジェクトにする
  cur->prev->next = newobj;

  // curのprevを新しいオブジェクトにする
  cur->prev = newobj;

  // curを新しいオブジェクトにする
  cur = newobj;
}

void list::move(int d)
{
  if (d == 0) return;
  if (d > 0) moveForward(d);
  else moveBackword(d * (-1));
}

void list::erase()
{
  if (cur == nil) return;
  // curのnexeのprevをcurのprevにする
  cur->next->prev = cur->prev;
  // curのprevのnextをcurのnextにする
  cur->prev->next = cur->next;

  node* p = cur;
  cur = cur->next;

  delete p;
}

void list::moveForward(int d)
{
  while (d > 0 && cur != nil)
  {
    cur = cur->next;
    --d;
  }
}

void list::moveBackword(int d)
{
  while (d > 0)
  {
    cur = cur->prev;
    --d;
  }
}

void list::dump()
{
  node* p = nil->next;
  while (p != nil)
  {
    printf("%d\n", p->val);
    p = p->next;
  }
}

void list::clear()
{
  node* p = nil->next;
  node* tmp;
  while (p != nil)
  {
    tmp = p;
    p = p->next;
    delete tmp;
  }
  delete nil;
}


int main()
{
  int q, i, c, n;
  list arylist;

  scanf("%d", &q);

  for (i = 0; i < q; i++)
  {
    scanf("%d", &c);
    switch (c)
    {
    case 0:
      scanf("%d", &n);
      arylist.insert(n);
      break;
    case 1:
      scanf("%d", &n);
      arylist.move(n);
      break;
    case 2:
      arylist.erase();
      break;
    }
  }

  arylist.dump();

  return 0;
}