#include <bits/stdc++.h>

#define inf 0x3f3f3f3f

#define MAX 1e3

#define FRE() freopen("in.txt","r",stdin)

#define FRO() freopen("out.txt","w",stdout)

using namespace std;

typedef long long ll;

const int maxn = ;

bool mp[maxn][maxn];

int fa[maxn],d,lk[maxn],vis[maxn];

int idx,path[maxn],cnt;

void init(){

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

        fa[i] = i;

    }

    memset(lk,,sizeof(lk));

    memset(vis,,sizeof(vis));

    memset(mp,,sizeof(mp));

    memset(path,,sizeof(path));

}

int _find(int x){//并查集查找祖先

    return fa[x]==x ? x : fa[x] = _find(fa[x]);

}

void mergeNode(int x,int y){//合并不属于同一个连通分量的两个点

    int tx = _find(x),ty = _find(y);

    if(tx != ty){

        fa[tx] = ty;

    }

}

bool isLinked(int x,int y){//判断两个点是不是属于同一个连通分量

    if(_find(x)!=_find(y)){

        return false;

    }

    return true;

}

void DFS(int now, int MX){

    if(now==d){//搜索到d就输出；路径

        cnt++;

        printf("");

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

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

        }

        printf("\n");

    }else{

        //cout<<now<<endl;

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

            int u = lk[i];

            if(!vis[u] && mp[now][u]){

                vis[u] = true;

                path[MX] = u;//这里其实没必要另开一个数组保存路径，在下一个循环的时候当前的路径已经输出或没用了

                DFS(u,MX+);

                vis[u] = false;

            }

        }

    }

}

void check(){

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

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

    }

    printf("\n");

}

int main(){

    //FRE();

    int kase=;

    while(scanf("%d",&d)!=EOF){

        int st,en;

        init();

        while(scanf("%d%d",&st,&en)&&st){

            mp[st][en] = ;

            mp[en][st] = ;

            mergeNode(st,en);

        }

        printf("CASE %d:\n",++kase);

        if(isLinked(,d)==false){

            printf("There are 0 routes from the firestation to streetcorner %d.\n",d);

        }else{

            idx=;

            for(int i=; i<maxn; i++){//找到与d在同一个连通分量里边的点并保存

                if(isLinked(i, d)){

                    lk[idx++] = i;

                }

            }

            sort(lk,lk+idx);//从小到大排序，保证字典序

            //check();

            cnt = ;

            DFS(, );

            printf("There are %d routes from the firestation to streetcorner %d.\n",cnt,d);

        }

    }

    return ;

}