523. Elevator

Time limit per test: 0.25 second(s)
Memory limit: 262144 kilobytes
input: standard
output: standard

The Berland State Building is the highest building in the capital of Berland. Curious Polikarp was studying the principle of operation of an elevator in the Berland State Building for a quite a while. Recently he has finally understood the algorithm behind its operation, in case a person enters the elevator on the floor f and presses the floor buttons e1, e2,..., en one by one. The buttons are pressed sequentially but very quickly while the elevator is still located on the floor f. All the pressed buttons are distinct and differ from the floor f. No other button pressings are considered in this problem.

After the buttons e1, e2,..., en have been pressed, all of them become highlighted and the elevator starts moving according the following rules:

Now, when the principle of the elevator's operation is clear, Polikarp wants to experiment with the elevator's movements without the elevator itself. He wants to write a program that simulates elevator's operation. Unfortunately, he didn't attend any programming lessons and it's a challenge for him. Can you please help Polikarp and write a program which will simulate movements of the elevator?

Input
The first line of input contains a pair of integers n, f (1 ≤ n, f ≤ 100), where n — amount of pressings made, f — index of the current floor where all these pressings were made. The second line contains distinct integers e1, e2,..., en (1 ≤ ei ≤ 100, ei ≠q f) — buttons indices in the order they were pressed.

Output
Output all the floors where the elevator stops, in a chronological order of the stops.

Example(s)
sample input
sample output
4 5
10 9 2 1
9 10 2 1 

sample input
sample output
4 3
2 4 1 5
2 4 1 5 




Online Contester Team © 2002 - 2010. All rights reserved.