#include <cstdio>
#include <queue>
#include <map>
#include <vector>
#include <algorithm>

using namespace std;

int n,m;
//typedef map<int, vector<int> > M;

struct aaa
{
        int x, y;
        aaa() {}
        aaa(int ax, int ay): x(ax), y(ay) {}
        bool operator< (const aaa & rhs) const
        {
                return x > rhs.x;
        }

};

priority_queue<aaa> Q;

int q[202020];

int qu[202020];
int main()
{
    while(scanf("%d %d", &n, &m), n!=0 && m!=0) {
//        M inq;
        memset(q, 0, sizeof(int) * (m+10));
        int maxqu=0;
        bool ok=true;
        for(int i=0; i<n; i++) {
            int a;
            scanf("%d", &a);
//            int j;
            int * lb = lower_bound(q, q + m, a, greater<int>());
//            printf("lb:%d;", lb - q);
            if (lb == q + m)
            {
                    ok = false;
                    scanf("\n");
                    break;
            }
            *lb = a;
/*            
            for(j=0; j<m; j++) {
                if(q[j]<=a) {
                    q[j]=a;*/

            Q.push(aaa(a, lb - q));
/*                    if(inq.find(a)==inq.end()) 
                        inq.insert(make_pair(a, vector<int>()));
                    inq[a].push_back(lb - q);*/

                    qu[maxqu++]=lb - q;
/*                    break;
                }
            }
            if(j==m) {
                ok=false;
                break;
            }*/
        }
        if(!ok) {
            puts("Transportation failed");
        } else {
            printf("%d", qu[0]+1);
            for(int i=1; i<maxqu; ++i) {
                printf(" %d", qu[i]+1);
            }
            puts("");

//            bool first=true;

            printf("%d", Q.top().y + 1);
            Q.pop();
            while (Q.size())
            {
                    printf(" %d", Q.top().y + 1);
                    Q.pop();
            }
/*            for(M::iterator i=inq.begin(); i!=inq.end(); ++i) {
                vector<int> &t=i->second;
                for(vector<int>::iterator j=t.begin(); j!=t.end(); ++j) {
                    printf("%s%d", first?"":" ", *j+1);
                    first=false;
                }
            }*/
            puts("");
        }
    }
    return 0;
}