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 <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD 1000000007

// #define DEBUG_F
 
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
template <class T>
void print(T& x){printf("%d\n", x);}
void printvec(vector<int> a){
    rep(i, a.size()-1){
        printf("%d ", a[i]);
    }
    printf("%d\n", a[a.size()-1]);
}

struct Node{
    int x;
    Node *prev;
    Node *next;
};

Node ed;
Node *cur, *head;

Node *newNode(){
    Node *p = (Node*)malloc(sizeof(Node));
    return p;
}

void insert(int x){
#ifdef DEBUG_F
    printf("insert(%d)\n", x);
#endif

    Node *p;
    p = newNode();
    p->x = x;
    p->next = cur;
    p->prev = cur->prev;
    if(cur->prev==NULL){
        head = p;
    }else{
        cur->prev->next = p;
    }
    cur->prev = p;
    cur = p;
}

void move_(int d){
#ifdef DEBUG_F
    printf("move(%d)\n", d);
#endif

    if(d>0){
        rep(i, d) cur = cur->next;
    }else if(d<0){
        rep(i, -d) cur = cur->prev;
    }
}

void erase(){
#ifdef DEBUG_F
    printf("erase()\n");
#endif
    if(cur->prev==NULL){ //先頭にいる
        cur->next->prev = NULL;
        cur = cur->next;
        head = cur;
    }else{
        cur->prev->next = cur->next;
        cur->next->prev = cur->prev;
        cur = cur->next;
    }
}
 
int main()
{
    ed.next = NULL;
    ed.prev = NULL;
    ed.x = INT32_MAX;
    cur = &ed;
    head = &ed;

    int q;
    cin >> q;

    int com, d;
    rep(i, q){
        cin >> com;
        if(com == 0){
            cin >> d;
            insert(d);
        }else if(com==1){
            cin >> d;
            move_(d);
        }else if(com==2){
            erase();
        }
#ifdef DEBUG_F
        Node *tmp = head;
        while(tmp->next != NULL){
            if(tmp==cur) printf(">");
            print(tmp->x);
            tmp = tmp->next;
        }
#endif
    }
#ifdef DEBUG_F
    printf("\n");
#endif
    while(head->next != NULL){
        print(head->x);
        head = head->next;
    }
    return 0;
}