#include <bits/stdc++.h>

using namespace std;
int n,m,a[101];
ifstream f("be.in");

int main()
{
    cin>>n>>m;
    for (int i=1; i<=m; i++) cin>>a[i];
    //elozo
    if (a[m]==m) {
        for (int i=1; i<=m; i++) cout<<n-m+i<<" ";
        cout<<endl;
    }
    else {
        int b[101];
        b[m]=a[m]-1;
        for (int j=m-1; j>=1; j--) {
            if (a[j]==b[j+1]) b[j]=a[j]-1;
            else b[j]=a[j];
        }
        for (int i=1; i<=m; i++) cout<<b[i]<<" ";
        cout<<endl;
    }
    //kovetkezo
    if (a[1]==n-m+1) {
        for (int i=1; i<=m; i++) cout<<i<<" ";
    }
    else {
        int j=m,b[101];
        while (a[j]==n-m+j) j--;
        //cout<<j<<endl;
        a[j]=a[j]+1;
        for (int t=1; t<=j; t++) cout<<a[t]<<" ";
        for (int t=j+1; t<=m; t++) {
            a[t]=a[t-1]+1;
            cout<<a[t]<<" ";
        }
    }
    return 0;
}