// Do it recursively

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

int N, M;
vector<int>a;

bool prev(int x)
{
    if(x != N-1)
    {
        if(prev(x+1))return 1;
    }
    if(x != 0 && a[x]-1 != a[x-1])
    {
        for(int j = 0; j < x; j++)cout << a[j] << " ";
        cout << a[x]-1 << " ";
        for(int j = x+1; j < N; j++)cout << a[j] << " ";
        return 1;
    }
    if(x == 0 && a[x] != 1)
    {
        cout << a[0]-1 << " ";
        for(int j = 1; j < N; j++)cout << a[j] << " ";
        return 1;
    }
    return 0;
    
}

bool nxt(int x)
{
    if(x != N-1)
    {
        if(nxt(x+1))return 1;
    }
    if(x != N-1 && a[x]+1 != a[x+1])
    {
        for(int j = 0; j < x; j++)cout << a[j] << " ";
        cout << a[x]+1 << " ";
        for(int j = x+1; j < N; j++)cout << a[j] << " ";
        return 1;
    }
    if(x == N-1 && a[x] != M)
    {
        for(int j = 0; j < N-1; j++)cout << a[j] << " ";
        cout << a[x]+1 << " ";
        return 1;
    }
    return 0;
}

int main() {
	cin >> M >> N;
    a.resize(N);
    for(int &i : a)cin >> i;
    if(!prev(0))
    {
        for(int i = 0; i < N; i++)
        {
            cout << M-(N-i)+1 << " ";
        }
    }
    cout << "\n";
    if(!nxt(0))
    {
        for(int i = 0; i < N; i++)
        {
            cout << i+1 << " ";
        }
    }
}