#include <bits/stdc++.h>

using namespace std;
int maxnum, len;
vector<int> order;
vector<int> orderADD;
vector<int> orderSUB;
vector<int> first;
vector<int> last;
void Add(int n)
{
    if(n == -1)
    {
        orderADD=first;
        return;
    }
    if(orderADD[n]==maxnum-len+n+1)
    {

        Add(n-1);
    }
    else
    {
        ++orderADD[n];
        for(int i = n+1; i < len;++i)
        {
            orderADD[i] = orderADD[n]+i-n;
        }
    }
}
void Sub(int n)
{
    if(n == 0 && orderSUB[n] == 1)
    {
        orderSUB = last;
        return;
    }
    else if(n == 0)
    {
        --orderSUB[n];
        for(int i = n+1; i < len;++i)
        {
            orderSUB[i] = last[i];
        }
        return;
    }

    //cout << n << " " << orderSUB[n-1] << "-" << orderSUB[n] << endl;
    if(orderSUB[n-1] == orderSUB[n]-1)
    {
        Sub(n-1);
        //cout << "a";
    }
    else
    {
        --orderSUB[n];
        for(int i = n+1; i < len;++i)
        {
            orderSUB[i] = last[i];
        }
        //cout << "b";
    }
}

int main()
{
    cin.tie(0);
    iostream::sync_with_stdio(0);

    cin >> maxnum >> len;

    order.resize(len);

    for(int i = 0; i <len;++i)
    {
        cin >> order[i];
    }
    first.resize(len);
    for(int i = 0; i<len;++i)
    {
        first[i] = i+1;
    }
    last.resize(len);
    for(int i = 0; i<len;++i)
    {
        last[len-i-1] = maxnum-i;
    }



    orderADD = order;
    orderSUB = order;



    Add(len-1);

    //cout << endl;
    Sub(len-1);

    for(int x: orderSUB)
    {
        cout << x << " ";
    }
    cout << endl;
    for(int x: orderADD)
    {
        cout << x << " ";
    }
}