Algorithms and Data Structures

Remove the K-th element of 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. remove k - the program should remove the k-th element from the linked list.

Input

The initial data for the linked list is obtained automatically. You don’t need to do anything.
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 remove k if the program should remove 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
10 4 0 -2 3 5 7 -1 8 -9 3 5 print remove 2 remove 9 print print
4 0 -2 3 5 7 -1 8 -9 3 4 -2 3 5 7 -1 8 -9 4 -2 3 5 7 -1 8 -9
 

Constraints

Time limit: 2 seconds

Memory limit: 512 MB

Output limit: 10 MB

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