#include <stdio.h>
#include <map>
#include <queue>
using namespace std;

int N,M;
int res[1000000];

struct hodn {
  hodn(int av, int ak) : v(av), k(ak) {}
  int v, k;
  bool operator<(const hodn& b) const { return v > b.v; }
};

queue<int> qs[200005];
priority_queue<hodn> pq;

int main(void) {
  multimap<int,int> m;
  while (scanf("%d%d", &N, &M), N||M) {
    int front=0;
    m.clear();
    int i;
    for (i=0;i<N;i++) {
      int v; scanf("%d", &v);
      multimap<int,int>::iterator it=m.lower_bound(v);
      if (it==m.begin() && (it==m.end() || it->first > v)) {
	if (front<M) {
	  res[i]=++front;
	  qs[front].push(v);
	  m.insert(pair<int,int>(v, front));
	  continue;
	}
	else {
	  puts("Transportation failed");
	  for (i++;i<N;i++) scanf("%d", &v);
	  for (i=1; i<=front; i++) while (!qs[i].empty()) qs[i].pop();
	  i=N+1;
	  break;
	}
      }
      if (it==m.end() || it->first > v) it--;
      int kolej=it->second;
      res[i]=kolej;
      m.erase(it);
      m.insert(pair<int,int>(v, kolej));
      qs[kolej].push(v);
    }
    if (i==N) {
      for (i=0;i<N;i++) printf("%d%c", res[i], " \n"[i==N-1]);

      for (i=1;i<=front;i++) {pq.push(hodn(qs[i].front(),i)); qs[i].pop(); }
      for (i=0;i<N;i++) {
	hodn h=pq.top(); pq.pop();
	printf("%d%c", h.k, " \n"[i==N-1]);
	if (!qs[h.k].empty()) {pq.push(hodn(qs[h.k].front(), h.k)); qs[h.k].pop(); }
      }
    }
  }

  return 0;
}