#include <bits/stdc++.h>
using namespace std;

template<class value_type>
class my_list{
public:
  class node{
  public:
    value_type value;
    node* front;
    node* back;
    node(value_type value_):value(value_),front(nullptr),back(nullptr){}
  };
  int n;
  node* front_;
  node* back_;
  my_list():n(0){
    front_ =
      back_ = new node(-1);
  }

  class iterator{
  public:
    node* current;
    iterator(node* current_):current(current_){}
    iterator():current(nullptr){}
    iterator& operator++(){
      current = current->back;
      return *this;
    }
    iterator& operator--(){
      current = current->front;
      return *this;
    }
    bool operator!=(iterator const& other){
      return current != other.current;
    }
    value_type& operator*(){
      return current->value;
    }
  };

  iterator insert(iterator itr,value_type value){
    ++n;
    node* add = new node(value);
    node* front = itr.current->front;
    node* back = itr.current;
    if(front!=nullptr){
      add->front = front;
      front->back = add;
    }else{
      front_ = add;
    }
    if(back!=nullptr){
      add->back = back;
      back->front = add;
    }
    return iterator(add);
  }

  iterator erase(iterator itr){
    --n;
    node* front = itr.current->front;
    node* back = itr.current->back;
    if(front!=nullptr){
      front->back = back;
    }else{
      front_ = back;
    }
    if(back!=nullptr){
      back->front = front;
    }
    delete itr.current;
    return iterator(back);
  }

  iterator begin(){
    return iterator(front_);
  }
  iterator end(){
    return iterator(back_);
  }
};


int main(){
  int q;
  my_list<int> li;
  my_list<int>::iterator itr = li.end();
  cin >> q;
  for(int i=0;i<q;++i){
    int kind;
    cin >> kind;
    if(kind==0){
      int x;
      cin >> x;
      itr = li.insert(itr,x);
    }else if(kind==1){
      int d;
      cin >> d;
      while(d){
        if(d>0){
          ++itr;
          --d;
        }else{
          --itr;
          ++d;
        }
      }
    }else{
      itr = li.erase(itr);
    }
  }
  for(auto&i:li){
    cout << i << endl;
  }
}


### Prompt

Generate a cpp solution to the following 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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;

template<class value_type>
class my_list{
public:
  class node{
  public:
    value_type value;
    node* front;
    node* back;
    node(value_type value_):value(value_),front(nullptr),back(nullptr){}
  };
  int n;
  node* front_;
  node* back_;
  my_list():n(0){
    front_ =
      back_ = new node(-1);
  }

  class iterator{
  public:
    node* current;
    iterator(node* current_):current(current_){}
    iterator():current(nullptr){}
    iterator& operator++(){
      current = current->back;
      return *this;
    }
    iterator& operator--(){
      current = current->front;
      return *this;
    }
    bool operator!=(iterator const& other){
      return current != other.current;
    }
    value_type& operator*(){
      return current->value;
    }
  };

  iterator insert(iterator itr,value_type value){
    ++n;
    node* add = new node(value);
    node* front = itr.current->front;
    node* back = itr.current;
    if(front!=nullptr){
      add->front = front;
      front->back = add;
    }else{
      front_ = add;
    }
    if(back!=nullptr){
      add->back = back;
      back->front = add;
    }
    return iterator(add);
  }

  iterator erase(iterator itr){
    --n;
    node* front = itr.current->front;
    node* back = itr.current->back;
    if(front!=nullptr){
      front->back = back;
    }else{
      front_ = back;
    }
    if(back!=nullptr){
      back->front = front;
    }
    delete itr.current;
    return iterator(back);
  }

  iterator begin(){
    return iterator(front_);
  }
  iterator end(){
    return iterator(back_);
  }
};


int main(){
  int q;
  my_list<int> li;
  my_list<int>::iterator itr = li.end();
  cin >> q;
  for(int i=0;i<q;++i){
    int kind;
    cin >> kind;
    if(kind==0){
      int x;
      cin >> x;
      itr = li.insert(itr,x);
    }else if(kind==1){
      int d;
      cin >> d;
      while(d){
        if(d>0){
          ++itr;
          --d;
        }else{
          --itr;
          ++d;
        }
      }
    }else{
      itr = li.erase(itr);
    }
  }
  for(auto&i:li){
    cout << i << endl;
  }
}


```