//DFS
#include <bits/stdc++.h>
#define N 101
using namespace std;

ifstream fin("dfs.in");
ofstream fout("dfs.out");

vector<int> v[N];
bool viz[N];
int n,m,x;

void dfs(int s)
{
    if(viz[s])
        return;
    viz[s]=true;
    fout<<s<<" ";
    
    for(auto u:v[s])
        dfs(u);
}
int main()
{
    int i,j,a,b;
    
    fin>>n>>m>>x;
    
    for(i=0;i<m;i++)
    {
        fin>>a>>b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    
    for(i=1;i<=n;i++)
        sort(v[i].begin(),v[i].end());
    
    dfs(x);
    return 0;
}
//------------------------------------------------------------------------
//BFS
#include <bits/stdc++.h>
#define N 101
using namespace std;

ifstream fin("BFS.in");
ofstream fout("BFS.out");

vector<int> v[N];
queue<int> q;
bool viz[N];
int d[N],n,m,x;

int main()
{
    int i,a,b;
    
    fin>>n>>m>>x;
    
    for(i=0;i<m;i++)
    {
        fin>>a>>b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    
    for(i=1;i<=n;i++)
        sort(v[i].begin(),v[i].end());
        
    viz[x]=true;
    q.push(x);
    d[x]=0;
    fout<<x<<" ";
    while(!q.empty())
    {
        int s=q.front();
        q.pop();
        
        for(auto u:v[s])
            if(viz[u]==false)
            {
                viz[u]=true;
                d[u]=d[s]+1;
                q.push(u);
                
                fout<<u<<" ";
            }
            
    }
    return 0;
}