#include<iostream>
#include <bits/stdc++.h>

#define ll long long
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int N = 100 + 5, mod = 1e9 + 7;
int a[N];
int n, m;

int solve(int pos, int i) {
    if (i == m)return pos;
    if (a[i] == pos) return solve(pos + 1, i + 1);
    if (a[i] == pos - 1) return solve(pos - 1, i + 1);
    return solve(pos, i + 1);
}

void doWork() {
    cin >> n >> m;
    for (int i = 0; i < m; i++) {
        cin >> a[i];
    }
    vector<int> ans(n);
    for (int i = 1; i <= n; i++) {
        ans[solve(i, 0) - 1] = i;
    }
    for (auto i: ans)cout << i << "\n";
}

int main() {
    IO
    int t = 1;
    //cin >> t;
    for (int i = 1; i <= t; i++) {
        //  cout << "Case #" << i << ": ";
        doWork();
    }
}