#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int N, M;
int A[510];
int dp[510];
int main(void){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    cin >> N >> M;
    for(int i = 0;i < M;i++)cin >> A[i];
    for(int i = 1;i <= N;i++)dp[i] = i - 1;
    for(int i = M - 1;i >= 0;i--){
        dp[A[i]] = dp[A[i] + 1] = min(dp[A[i]], dp[A[i] + 1]);
    }
    for(int i = 2;i <= N;i++){
        cout << dp[i] << " \n"[i == N];
    }
    return 0;
}