#include <iostream>
#include <vector>

using namespace std;

vector<int> vonj(vector<int> v, int ind, int base)
{
	if (ind > 0)
	{
		v[ind] = v[ind] - 1;
		if (v[ind] == v[ind - 1])
		{
			v[ind] = base;
			return vonj(v, ind - 1, base - 1);
		}
		return v;
	}
	v[ind] = v[ind] - 1;
	return v;
}

 vector<int> adj(vector<int> v, int ind, int base)
{
	 if (ind > 0)
	 {
		 if (v[ind] == base)
		 {
			 return adj(v, ind - 1, base - 1);
		 }
		 else
		 {
			 v[ind] = v[ind] + 1;
			 return v;
		 }
	 }
	 return v;
}

void pr(vector<int> v)
{
	for (auto& e : v)
		cout << e << " ";
}

void prel(int n)
{
	for (int i = 1; i <= n; ++i)
		cout << i << " ";
}

void prut(int base, int n)
{
	for (int i = 1; i <= n; ++i)
		cout << base - n + i << " ";
}

int main()
{
	int base, n;
	cin >> base >> n;
	vector<int> v;
	int t, el=0;
	for (int i = 1; i <= n; ++i)
	{
		cin >> t;
		if (t == i)
			el++;
		v.push_back(t);
	}
	if (el == n)
		prut(base, n);
	else
		pr(vonj(v, n - 1, base));
	cout << endl;
	if (v[0] == base - n + 1)
		prel(n);
	else
		pr(adj(v, n - 1, base));
}