Algorithms and Data Structures

Insert a node at K-th position in a linked list

Given a linked list, you are asked to execute q queries on it. There are 2 types of queries:
  1. print - the program should print the linked list
  1. insert k x - the program should insert a new node with value x after the k-th node in the linked list

Input

The first line of the input contains a single integer q (1 ≤ q ≤ 1000).
The next q lines contain the queries - print in case the program should print the linked list, and insert k x if the program should insert a new node with value x ( ≤ x ≤ ) after the k-th node (0 ≤ k ≤ |L|).

Output

The program should correctly print the values in the linked list for all the print queries. The values should be separated by spaces.

Examples

Input
Output
5 insert 0 100 print insert 1 200 insert 0 50 print
100 50 100 200
 

Constraints

Time limit: 2 seconds

Memory limit: 512 MB

Output limit: 1 MB

To check your solution you need to sign in
Sign in to continue