#define _CRT_SECURE_NO_DEPRECATE
#define _SECURE_SCL 0
#pragma comment(linker, "/STACK:66777216")
#include <algorithm>
#include <string>
#include <complex>
#include <cassert>
#include <memory>
#include <set>
#include <stack>
#include <map>
#include <list>
#include <deque>
#include <numeric>
#include <cctype>
#include <cstddef>
#include <vector>
#include <queue>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <sstream>
#include <fstream>
#include <ctime>
#include <cstring>
#include <functional>
#include <bitset>
using namespace std;

#if defined(_MSC_VER) || defined(__BORLANDC__)
typedef unsigned __int64 uint64;
typedef signed __int64 int64;
#else
typedef unsigned long long uint64;
typedef signed long long int64;
#endif
typedef vector<int> VI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int64, int64> PLL;
typedef vector<int64> VL;

#define pb push_back
#define ppb pop_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
#define pdd pair<double,double>
#define FOR(i,a,b) for (int _n(b), i(a); i <= _n; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b);i>=_b;i--)
#define all(c) (c).begin(), (c).end()
#define SORT(c) sort(all(c))
#define REP(i,n) FOR(i,1,(n))
#define REPT(i,n) FOR(i,0,(n)-1)
#define L(s) (int)((s).size())
#define C(a) memset((a),0,sizeof(a))
#define IOS ios::sync_with_stdio(false)

const double pi = 3.1415926535897932384626433832795028841971;
const double EPS = 1E-9;
const int64 INF64 = ( int64 )1E18;
const int INF = 1000000000;

static inline bool get( int &v ) {
    int s = 1, c;
    while( !isdigit( c = getchar() ) && c != '-' )
        if( c == EOF )    break ;
    if( c == EOF ) return 0;
    if( c == '-' ) s = 0 , v = 0;
    else v = c ^ 48;
    for( ; isdigit( c = getchar() ); v = ( v << 1 ) + ( v << 3 ) + ( c ^ 48 ) );
    v = ( s ? v : -v );
    return 1 ;
}

/*
×¢ÒâÁ´±íµÄÆðʼµØÖ·¿ÉÒÔ´ÓÖмäµÄ½Úµã¿ªÊ¼£¬×îºóÒ»¸öTest¿ÓËÀÁË
*/

struct node_line
{
    int address, data, next;
}tmp;

pair<int, int> node[100099];

vector< node_line > vList;
void run() {
    int start, n, k, i, j, prev, data, nxt;
    cin >> start >> n >> k;
    for (i = 0; i < n; i++) {
        cin >> prev >> data >> nxt;
        node[prev].first = data;
        node[prev].second = nxt;
    }
    int cur_node = start;
    while (cur_node != -1) {
        tmp.address = cur_node;
        tmp.data = node[cur_node].first;
        tmp.next = node[cur_node].second;
        cur_node = tmp.next;
        vList.push_back(tmp);
    }
    int num = vList.size() / k;
    for (i = 0; i < num; i++) {
        for (j = (i+1)*k-1; j >= i*k; j--) {
            printf("%05d %d ",vList[j].address, vList[j].data);

            if (j == i*k) {
                if (i < num-1) {
                    printf("%05d", vList[(i+2)*k-1].address);
                } else {
                    if ((i+1)*k < vList.size()) {
                        printf("%05d", vList[(i+1)*k].address);
                    } else {
                        printf("-1");
                    }
                }
            } else {
                printf("%05d", vList[j-1].address);
            }
            printf("\n");

        }
        
    }
    if (vList.size() % k != 0) {
        num = vList.size()%k;
        for (i = vList.size()-num; i < vList.size(); i++) {
            printf("%05d %d ", vList[i].address, vList[i].data);
            if (i == vList.size()-1)    printf("-1\n");
            else printf("%05d\n", vList[i+1].address);
        }

    }

}


int main() {
#ifdef __DEBUG__
    freopen( "test.in", "r", stdin );
    freopen( "test.out", "w", stdout );
    time_t st = clock();
#endif
    run();
#ifdef __DEBUG__
    printf( "\n=============\n" );
    printf( "Time: %.2lf sec\n", ( clock() - st ) / double( CLOCKS_PER_SEC ) );
#endif
    return 0;
}