模板题
#include <bits/stdc++.h>
using namespace std;
struct node {
int data, next;
}Node[100000];
vector<int> v, ans;
int main() {
int fAd, n, k, ad, data, next;
scanf ("%d %d %d", &fAd, &n, &k);
for (int i = 0; i < n; i++) {
scanf ("%d %d %d", &ad, &data, &next);
Node[ad].data = data;
Node[ad].next = next;
}
while (fAd != -1) {
v.push_back(fAd);
// cout << Node[fAd].data << endl;
fAd = Node[fAd].next;
}
int t = v.size() / k;
for (int i = t * k; i < v.size(); i++) {
ans.push_back(v[i]);
// cout << pos << " :" << v[i] << endl;
}
for (int i = t - 1; i >= 0; i--) {
for (int j = i * k; j < (i + 1) * k; j++) ans.push_back(v[j]);
}
for (int i = 0; i < ans.size(); i++) {
if (i != ans.size() - 1) printf ("%05d %d %05d\n", ans[i], Node[ans[i]].data, ans[i + 1]);
else printf ("%05d %d -1\n", ans[i], Node[ans[i]].data);
}
}