#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

#define fi first
#define se second
#define pp push_back
#define all(x) (x).begin(), (x).end()
#define Ones(n) __builtin_popcount(n)
#define endl '\n'
#define mem(arrr, xx) memset(arrr,xx,sizeof arrr)
//#define int long long
#define debug(x) cout << (#x) << " = " << x << endl

void Gamal() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
#ifdef Clion
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}

int dx[] = {+0, +0, -1, +1, +1, +1, -1, -1};
int dy[] = {-1, +1, +0, +0, +1, -1, +1, -1};

const double EPS = 1e-9;
const ll OO = 0X3F3F3F3F3F3F3F3F;
const int N = 100 + 5, INF = INT_MAX, MOD = 1e9 + 7, LOG = 20;

vector<pii>adj[N];

int dfs(int u,int t){
    auto it = upper_bound(all(adj[u]), make_pair(t,INF));
    if(it == adj[u].end())return u;
    return dfs(it->se,it->fi);
}

void solve() {
    int n,m;cin >> n >> m;
    for (int i = 0; i < m; ++i) {
        int a;cin >> a;
        adj[a].emplace_back(i,a + 1);
        adj[a + 1].emplace_back(i,a);
    }
    vector<int>ans(n + 1);
    for (int i = 1; i <= n; ++i) {
        ans[dfs(i,-1)] = i;
    }
    for (int i = 1; i <= n; ++i) {
        cout << ans[i] << endl;
    }
}


signed main() {
    Gamal();
    int t = 1;
//    cin >> t;
    while (t--) {
        solve();
    }
}