#include <iostream>
#include <fstream>
#include <queue>
using namespace std;
ifstream in("arbore.in");
ofstream out("arbore.out");
queue <int> coada;
int a[101][101],f[101],v[101];
int main()
{
    int n,k,x,y,i;
    in>>n>>k;
    for(i=1;i<n;i++)
    {
        in>>x>>y;
        a[x][y]=1;
        a[y][x]=1;
    }
    coada.push(k);
    f[k]--;
    while(coada.empty()==false)
    {
        x=coada.front();
        for(i=1;i<=n;i++)
            if(a[x][i]==1 && f[i]==0)
            {
                coada.push(i);
                v[i]=x;
                f[i]--;
            }
        coada.pop();
    }
    for(i=1;i<=n;i++)
        out<<v[i]<<" ";
    return 0;
}