#include <queue>
#include <cstdio>
#include <iostream>
using namespace std;

int main(void){
	 int tracks;
	 int cars;
	 int car;
	
	 int* car_buffer = new int[200000];
	 int car_buffer_p = 0;
	 	 	
  while (true) {	 	 	 
	 cin >> cars;
	 cin >> tracks;
	 car_buffer_p = 0;

	 if (cars==0 && tracks==0) return 0;
	 
	 queue<int> *q = new queue<int>[tracks]; 
  	 
  	 int cur_track = 0;
	 	bool added = false;  	 		 	
  	 for (int cur_car=0; cur_car<cars;cur_car++){
  	 	cin >> car;  
		added = false;
  	 	for(int j = 0;j<cur_track;j++){
  	 		if (q[j].empty() || car >= q[j].back()){
//  	 			cout << j+1 << " " ;
  	 			car_buffer[car_buffer_p] = j+1;
  	 			car_buffer_p++;
  	 			q[j].push(car);
  	 			added=true;
  	 			break;
  	 		} else continue;  	 		
  	 	}   	 	
  	 	if (!added){
  	 		if (cur_track<tracks){
  	 			q[cur_track].push(car);
  	 			//cout << cur_track+1 << " " ;
  	 			car_buffer[car_buffer_p] = cur_track+1;
  	 			car_buffer_p++;
  	 			cur_track++;
  	 		}
  	 		else {
  	 			cout << "Transportation failed" << endl;  	 	
  	 			return 0;
  	 		}  	 		
  	 	}
  	 }
  	 for (int i = 0 ; i<car_buffer_p; i++){
		if (i==car_buffer_p-1) cout << car_buffer[i];
		else cout << car_buffer[i] << " ";
	 }
  	 
  	 
  	 cout << endl;

  	 for (int cur_track = tracks-1;cur_track>=0;cur_track--){
/*  	 	if (!q[cur_track].empty() ){
  	 		cout << cur_track+1;
  	 		q[cur_track].pop();
	  	 	while (!q[cur_track].empty()){
  		 		cout << " " << cur_track+1 ;
  		 		q[cur_track].pop();
	  	 	}	  	 	
  	 	}
  	 	cout << " ";  	*/
  	 	while (!q[cur_track].empty()){
	 		cout << cur_track+1;
	 		q[cur_track].pop();
	 		if (!q[cur_track].empty() || (cur_track != 0))
		 		cout << " ";
  	 	}	  	 	
  	 }
  	 cout << endl;
  }
  	 return 0;  	
}