#include <iostream>
#include <map>
#include <set>
#include <utility>
#include <algorithm>
#include <vector>
using namespace std;

int a[300000], b[300000], res[300000], t[300000];
typedef pair<int, int> PI;
int main() {
	int n, m;
	int ma=(1LL<<31)-1;
	while (scanf("%d %d", &n, &m) == 2) {
		if (!n && !m) break;
		for (int i=0; i<n; i++) scanf("%d", &a[i]);

		set<PI> x;
		vector<PI> z;
		x.insert(PI(ma, n));
		for (int i=n-1; i>=0; i--) {
			set<PI>::iterator y = x.lower_bound(PI(a[i], i));
			b[i] = y->second;
			x.insert(PI(a[i], i));
			z.push_back(PI(a[i], i));
			res[i] = -1;
		}
		for (int i=0; i<m; i++) t[i] = 0;
		sort(z.begin(), z.end());

		int k=0, co=0;
		while (k<m+1) {
			while (co<n && res[z[co].second] != -1)
				co++;
			if (co >= n) break;
			int u=z[co].second;
			t[k] = 0;
			while (u<n) {
				res[u] = k;
				u = b[u];
				t[k]++;
			}
			k++;
		}

		if (k<=m) {
			for (int i=0; i<n; i++) {
				printf("%d", res[i]+1);
				if (i+1<n) printf(" ");
			}
			printf("\n");
			vector<int> q;
			for (int i=0; i<m; i++)
				for (int j=0; j<t[i]; j++)
					q.push_back(i);
			for (int i=0; i<n; i++) {
				printf("%d", q[i]+1);
				if (i+1<n) printf(" ");
			}
			printf("\n");
		}
		else printf("Transportation failed\n");
	}
}