#include<cstdio>

 #include<iostream>

 #include<cstring>

 #include<queue>

 using namespace std;

 int point,cnt;

 int map[][];

 int vis[],path[];

 void dfs(int pos,int len){

     vis[pos]=;

     //下个点按从小到大顺序走

     for(int i=;i<=;i++){

         if(map[pos][i]){

             path[len]=pos;

             if(i==point&&len==){

                 printf("%d:  ",++cnt);

                 for(int i=;i<=;i++)

                     printf("%d ",path[i]);

                 printf("%d\n",point);

             }

             if(!vis[i])

                 dfs(i,len+);

         }

     }

     vis[pos]=;

 }

 int main(){

     int a,b,c;

     while(scanf("%d",&a)&&a){

         cnt=;

         memset(map,,sizeof(map));

         scanf("%d%d",&b,&c);

         map[][a]=map[][b]=map[][c]=;

         for(int i=;i<=;i++){

             scanf("%d%d%d",&a,&b,&c);

             map[i][a]=map[i][b]=map[i][c]=;

         }

         scanf("%d",&point);

         dfs(point,);

     }

     return ;

 }