A1052

#include<iostream>
#include<algorithm>
using namespace std;
struct Node{
	int address;
	int key;
	int next;
	bool flag;
}node[100010];//数组的下标是该结点的地址 
bool cmp(Node a,Node b ){//返回值是bool类型 传入的参数是Node类型 
	if(a.flag == false || b.flag ==false){//a b中有无效结点 
		return a.flag>b.flag;
	}else{//a b 都是有效结点 
		return a.key<b.key;
	}
}

int main(){
	int n,s;//s头结点的地址
	int t_address,t_key,t_next;
	cin>>n>>s;
	for(int i =0;i<n;i++){//输入所有结点 
		cin>>t_address>>t_key>>t_next;
		node[t_address].address = t_address;
		node[t_address].key = t_key;
		node[t_address].next = t_next;
		node[t_address].flag = false;
	}
	int p,count=0;
	for(p=s;p!=-1;p=node[p].next){//标记有效结点 
		node[p].flag=true;
		count++;
	}
	if(count==0)
		printf("0 -1");
	else{
		sort(node,node+100010,cmp);
		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].key);
		else
			printf("%05d %d %05d\n",node[i].address,node[i].key,node[i+1].address);
		}	
	}
	return 0;
}