#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define deb(x...) 42
#endif

#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

#define MOD 1000000007

void solve() {
    ll n,m;
    cin>>n>>m;
    ll grid[m+2][n+2];
    memset(grid,-1,sizeof(grid));
    for(int i=0;i<n+1;i++){
        int x;
        cin>>x;
        grid[i+1][x]=1;
        grid[i+1][x+1]=0;
    }
    // for(int i=0;i<m+1;i++){ for(int j=0;j<=n+1;j++){
    //         cout<<grid[i][j]<<" ";
    //     }
    //     cout<<"\n";
    // }
    map<int,int>ans;
    for(int i=1;i<=n;i++){
        ll curl=0;
        ll curr=i;
        while(curl<m){
            curl++;
            // deb(curl,curr,grid[curl][curr]);
            if(grid[curl][curr]==-1){

            }
            else if(grid[curl][curr]==1){
                curr++;
            }
            else{
                curr--;
            }
            // deb(curl,curr);
        }
        // cout<<endl;
        // deb(curr,i);
        ans[curr]=i;
    }
    for(auto x:ans){
        cout<<x.S<<"\n";
    }
}


int main() {
  fast_io;
#ifdef LOCAL
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
  freopen("output.txt", "w", stderr);
#endif
  ll t = 1;
  // cin >> t;
  for(ll i = 0; i < t; i++) {
#ifdef LOCAL
    cout << "CASE " << i + 1 << ":\n";
#endif
    solve();
  }
#ifdef LOCAL
  cout << endl << "Finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec\n\n";
#endif
  return 0;
}