#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("dfs.in");
ofstream gout("dfs.out");
int n,m,nod;
bool a[101][101],viz[101];
void citire()
{
    int x,y;
    fin>>n>>m>>nod;
    while(m--)
    {
        fin>>x>>y;
        a[x][y]=a[y][x]=1;
    }
}
void DFS(int nod)
{
    viz[nod]=1;
    gout<<nod<<' ';
    for(int i=1; i<=n; ++i)if(a[i][nod]&&!viz[i])DFS(i);
}
int main()
{
    citire();
    DFS(nod);
    return 0;
}