#include <bits/stdc++.h>
using namespace std;
 
const int Max = 2e5;
int num[Max+1];
int pos[Max+1];
int main() 
{
	int N,X;
	cin >> N >> X;
	for(int i=1;i<=N;i++)
	{
		num[i]=i;
		pos[i]=i;
	}
	for(int j=0;j<X;j++)
	{
		int A,nxt;
		cin >> A;
		if(pos[A]<N)
		{
			nxt=num[pos[A]+1];
			swap(num[pos[A]+1],num[pos[A]]);
			swap(pos[A],pos[nxt]);
		}
		else
		{
			nxt=num[pos[A]-1];
			swap(num[pos[A]-1],num[pos[A]]);
			swap(pos[A],pos[nxt]);
		}
		for(int i=1;i<=N;i++)
			cout << num[i] << ' ';
		cout << '\n';
		for(int i=1;i<=N;i++)
			cout << pos[i] << ' ';
		cout << '\n';
	}
	for(int i=1;i<=N;i++)
		cout << num[i] << ' ';
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgpjb25zdCBpbnQgTWF4ID0gMmU1OwppbnQgbnVtW01heCsxXTsKaW50IHBvc1tNYXgrMV07CmludCBtYWluKCkgCnsKCWludCBOLFg7CgljaW4gPj4gTiA+PiBYOwoJZm9yKGludCBpPTE7aTw9TjtpKyspCgl7CgkJbnVtW2ldPWk7CgkJcG9zW2ldPWk7Cgl9Cglmb3IoaW50IGo9MDtqPFg7aisrKQoJewoJCWludCBBLG54dDsKCQljaW4gPj4gQTsKCQlpZihwb3NbQV08TikKCQl7CgkJCW54dD1udW1bcG9zW0FdKzFdOwoJCQlzd2FwKG51bVtwb3NbQV0rMV0sbnVtW3Bvc1tBXV0pOwoJCQlzd2FwKHBvc1tBXSxwb3Nbbnh0XSk7CgkJfQoJCWVsc2UKCQl7CgkJCW54dD1udW1bcG9zW0FdLTFdOwoJCQlzd2FwKG51bVtwb3NbQV0tMV0sbnVtW3Bvc1tBXV0pOwoJCQlzd2FwKHBvc1tBXSxwb3Nbbnh0XSk7CgkJfQoJCWZvcihpbnQgaT0xO2k8PU47aSsrKQoJCQljb3V0IDw8IG51bVtpXSA8PCAnICc7CgkJY291dCA8PCAnXG4nOwoJCWZvcihpbnQgaT0xO2k8PU47aSsrKQoJCQljb3V0IDw8IHBvc1tpXSA8PCAnICc7CgkJY291dCA8PCAnXG4nOwoJfQoJZm9yKGludCBpPTE7aTw9TjtpKyspCgkJY291dCA8PCBudW1baV0gPDwgJyAnOwp9

MTAgNgoxCjUKMgo5CjYKNg==

10 6
1
5
2
9
6
6