PAT 1052

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

const int maxn=100010;

struct Node
{
	int data;
	int address;
	int next;
	bool flag;
}node[maxn];	

bool cmp(Node a,Node b)
{
	if(a.flag==false||b.flag==false) return a.flag>b.flag;
	else return a.data<b.data;
}

int main()
{
	int n,begin;
	scanf("%d%d",&n,&begin);
	
	int i;
	int address;
	for(i=0;i<maxn;i++)
	{
		node[i].flag=false;
	}
	for(i=0;i<n;i++)
	{
		scanf("%d",&address);
		scanf("%d%d",&node[address].data,&node[address].next);
		node[address].address=address;
	}

	int count=0;
	for(i=begin;i!=-1;i=node[i].next)
	{
		node[i].flag=true;
		count++;
	}
	sort(node,node+maxn,cmp);
	if(count==0)
		printf("0 -1");
	else printf("%d %05d\n",count,node[0].address);
	for(int i=0;i<count;i++)
	{
		if(i==count-1)
		{
			printf("%05d %d -1\n",node[i].address,node[i].data);
		}
		else printf("%05d %d %05d\n",node[i].address,node[i].data,node[i+1].address);
	}
	system("pause");
	return 0;
}