#include <iostream>
#include <cstdio>
#include <string>
#include <set>
#include <algorithm>
using namespace std;
int por[200000];
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)

int bsearch(int it)
{
	int b=0,e=200000-1;

	int res = e;
	while (b <= e)
	{
		int m = (b + e) / 2;
		if (por[m] > it)
		{
			res = min(res, m);
			b = m + 1;
		}
		else if (por[m] < it) {e = m - 1;
 			res = min(res, m);
}
		else if (por[m] == it)
		{
			return m;
		}
	}
	return b;
}


int main()
{
	int N, M;
	while (1)
	{
		scanf("%d %d", &N, &M);
		if (!N) return 0;
int wher[2000000];
int r=0,it;

int k=0;int i,n,ind;

	for (i=0;i<M;i++) por[i]=0;
	for (i=0;i<N;i++){
		scanf("%i",&it);
		ind=bsearch(it);
		if (ind==M) {r=1; }else{
 		por[ind]=it;
		wher[i]=ind+1;
}		 
	}
int e=0;
if (!r) {
for(i=0;i<N;i++){
if (r) printf(" ");r=1;
printf("%i",wher[i]);
}
printf("\n");
}else printf("Transportation failed\n");

}
	return 0;
}