#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int n, m;
    cin >> n >> m;

    int f[n];
    rep(i,n)f[i] = i;

    rep(i,m){
        int a; cin >> a;
        a--;
        rep(j,n){
            if(f[j] == a){
                f[j] = 0;
            }else if(f[j] < a){
                f[j]++;
            }
        }
    }
    rep(i,n)if(f[i] == 0) cout << i + 1 << endl;
}