Gym - 101246F - Elevator

input.txt / output.txt
Statements

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 e₁, e₂, ..., e_n 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 floorf. No other button pressings are considered in this problem.

After the buttons e₁, e₂, ..., e_n have been pressed, all of them become highlighted and the elevator starts moving according the following rules:

• The elevator starts moving towards the floor, the button of which is highlighted and pressed first among all highlighted buttons. Say, it's floor/buttona.
• If on its way to a the elevator passes the floorb, the button of which is highlighted, it stops there, the light goes out for the buttonb unhighlighting it, and the floor b is considered visited. Then the elevator continues moving towards the floora. It is possible that there will be more than one floor such asb on the way to floor a — all these floors will be passed one by one according to the described algorithm.
• Having reached the floor a, the elevator stops there, the light goes out for the buttona unhighlighting it, and the floor a is considered visited. Then the elevator starts to move towards the floor, the button of which has been pressed the earliest among the currently highlighted buttons. That floor becomes a new value ofa. The elevator continues moving according to the rules described in the previous paragraph. If it's impossible to find a new value fora because there are no highlighted floor buttons, it means that all floors have been visited and the elevator stops.

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), wheren — amount of pressings made, f — index of the current floor where all these pressings were made. The second line contains distinct integerse₁, e₂, ..., e_n (1 ≤ e_i ≤ 100, e_i ≠ 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

Input

4 5
10 9 2 1

Output

9 10 2 1 

Input

4 3
2 4 1 5

Output

2 4 1 5

题意：坐电梯然后在一个楼层有好多人按了不同的楼层，根据先来后到的顺序，不过如果在前面人和原楼层之间的人可以在过程中下楼梯

思路：从头往后遍历一遍如果后面有在前面人俺的楼层之间的直接输出然后把标记清0，不过需要注意有两种情况，有可能是从高楼层到低楼层（降序输出），从低楼层到高楼层（升序输出）

ac代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;


int main()
{
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    int m,n;
    int a[105],b[105],h,flag;
    while(cin>>n>>m)
    {
        memset(b,0,sizeof(b));
        for(int i=1;i<=n;i++)
        {cin>>a[i];
         b[a[i]]=1;
        }
        int h=0;
        for(int i=1;i<=n;i++)
        {
            if(b[a[i]])
            {
              int g;
              if(a[i]>m)
              g=1;
              else
              g=-1;
              for(int k=m;k!=a[i];k+=g)
              {
                  if(b[k]==1)
                  {
                    if(h==n-1)
                    cout<<k<<endl;
                    else
                    cout<<k<<" ";
                    h++;
                    b[k]=0;
                  }
              }
              if(h==n-1)
              cout<<a[i]<<endl;
              else
              cout<<a[i]<<" ";
              h++;
              b[a[i]]=0;
            }
        }
    }
    return 0;
}