Example

Input

5 3
4
2
5


Output

5
2
4
1
3
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    int n, m;
    cin >> n >> m;
    vector<pair<int, int>> v(n);
    for (int i = 0; i < n; ++i) {
        v[i] = make_pair(0, i+1);
    }
    for (int i = 0; i < m; ++i) {
        int x;
        scanf("%d", &x);
        v[x-1].first = -i-1;
    }
    sort(v.begin(),v.end());
    for (int i = 0; i < n; ++i) {
        printf("%d\n", v[i].second);
    }
    return 0;
}
