#include <iostream>
#include <vector>
#include <list>
#include <fstream>

using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
class Graph
{
    int V;
    vector<int> *adj;
public:
    Graph(int V);
    void addEdge(int v, int w);
    void BFS(int s);
};

Graph::Graph(int V)
{
    this->V = V;
    adj = new vector<int>[V];
}

void Graph::addEdge(int v, int w)
{
    adj[v].push_back(w);
    adj[w].push_back(v);
}

void Graph::BFS(int s)
{
    bool *visited = new bool[V];
    for(int i = 0; i < V; i++)
        visited[i] = false;

    list <int> queue;

    visited[s] = true;
    queue.push_back(s);

    while(!queue.empty())
    {
        s = queue.front();
        fout << s << " ";
        queue.pop_front();
        for(int i = 0; i < adj[s].size(); i++)
        {
            if (!visited[adj[s][i]])
            {
                visited[adj[s][i]] = true;
                queue.push_back(adj[s][i]);
            }
        }
    }
    fout.close();
}

int main()
{
    int n,m, s, a, b;
    fin>>n>>m>>s;
    Graph g(n);
    for(int i = 0; i < m; i++)
    {
        fin>>a>>b;
        g.addEdge(a, b);
    }
    g.BFS(s);
    fin.close();
    return 0;
}