#include <iostream>
#include <vector>
#include <queue>
using namespace std;
 
// Function to perform BFS traversal of the graph
void BFS(int start, const vector<vector<int>>& adjList, int n) {
    vector<bool> visited(n, false); // Track visited nodes
    queue<int> q; // Queue for BFS
    q.push(start);
    visited[start] = true;
 
    while (!q.empty()) {
        int node = q.front(); // Get the node from the front of the queue
        q.pop();
        cout << node << " "; // Print the node
 
        // Visit all the adjacent nodes of the current node
        for (int neighbor : adjList[node]) {
            if (!visited[neighbor]) {
                visited[neighbor] = true;
                q.push(neighbor);
            }
        }
    }
}
 
int main() {
    int n, m;
    cin >> n >> m; // Number of nodes and edges
 
    vector<vector<int>> adjList(n); // Adjacency list for the graph
 
    // Read the graph edges
    for (int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        adjList[u].push_back(v); // Add v to the adjacency list of u
        adjList[v].push_back(u); // Add u to the adjacency list of v (for undirected graph)
    }
 
    int start;
    cin >> start; // Input the starting node for BFS
 
    BFS(start, adjList, n); // Perform BFS starting from the given node
 
    return 0;
}
 

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8cXVldWU+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgovLyBGdW5jdGlvbiB0byBwZXJmb3JtIEJGUyB0cmF2ZXJzYWwgb2YgdGhlIGdyYXBoCnZvaWQgQkZTKGludCBzdGFydCwgY29uc3QgdmVjdG9yPHZlY3RvcjxpbnQ+PiYgYWRqTGlzdCwgaW50IG4pIHsKICAgIHZlY3Rvcjxib29sPiB2aXNpdGVkKG4sIGZhbHNlKTsgLy8gVHJhY2sgdmlzaXRlZCBub2RlcwogICAgcXVldWU8aW50PiBxOyAvLyBRdWV1ZSBmb3IgQkZTCiAgICBxLnB1c2goc3RhcnQpOwogICAgdmlzaXRlZFtzdGFydF0gPSB0cnVlOwoKICAgIHdoaWxlICghcS5lbXB0eSgpKSB7CiAgICAgICAgaW50IG5vZGUgPSBxLmZyb250KCk7IC8vIEdldCB0aGUgbm9kZSBmcm9tIHRoZSBmcm9udCBvZiB0aGUgcXVldWUKICAgICAgICBxLnBvcCgpOwogICAgICAgIGNvdXQgPDwgbm9kZSA8PCAiICI7IC8vIFByaW50IHRoZSBub2RlCgogICAgICAgIC8vIFZpc2l0IGFsbCB0aGUgYWRqYWNlbnQgbm9kZXMgb2YgdGhlIGN1cnJlbnQgbm9kZQogICAgICAgIGZvciAoaW50IG5laWdoYm9yIDogYWRqTGlzdFtub2RlXSkgewogICAgICAgICAgICBpZiAoIXZpc2l0ZWRbbmVpZ2hib3JdKSB7CiAgICAgICAgICAgICAgICB2aXNpdGVkW25laWdoYm9yXSA9IHRydWU7CiAgICAgICAgICAgICAgICBxLnB1c2gobmVpZ2hib3IpOwogICAgICAgICAgICB9CiAgICAgICAgfQogICAgfQp9CgppbnQgbWFpbigpIHsKICAgIGludCBuLCBtOwogICAgY2luID4+IG4gPj4gbTsgLy8gTnVtYmVyIG9mIG5vZGVzIGFuZCBlZGdlcwoKICAgIHZlY3Rvcjx2ZWN0b3I8aW50Pj4gYWRqTGlzdChuKTsgLy8gQWRqYWNlbmN5IGxpc3QgZm9yIHRoZSBncmFwaAoKICAgIC8vIFJlYWQgdGhlIGdyYXBoIGVkZ2VzCiAgICBmb3IgKGludCBpID0gMDsgaSA8IG07IGkrKykgewogICAgICAgIGludCB1LCB2OwogICAgICAgIGNpbiA+PiB1ID4+IHY7CiAgICAgICAgYWRqTGlzdFt1XS5wdXNoX2JhY2sodik7IC8vIEFkZCB2IHRvIHRoZSBhZGphY2VuY3kgbGlzdCBvZiB1CiAgICAgICAgYWRqTGlzdFt2XS5wdXNoX2JhY2sodSk7IC8vIEFkZCB1IHRvIHRoZSBhZGphY2VuY3kgbGlzdCBvZiB2IChmb3IgdW5kaXJlY3RlZCBncmFwaCkKICAgIH0KCiAgICBpbnQgc3RhcnQ7CiAgICBjaW4gPj4gc3RhcnQ7IC8vIElucHV0IHRoZSBzdGFydGluZyBub2RlIGZvciBCRlMKCiAgICBCRlMoc3RhcnQsIGFkakxpc3QsIG4pOyAvLyBQZXJmb3JtIEJGUyBzdGFydGluZyBmcm9tIHRoZSBnaXZlbiBub2RlCgogICAgcmV0dXJuIDA7Cn0K

NSA0CjAgMQowIDIKMSAzCjEgNAowCg==

5 4
0 1
0 2
1 3
1 4
0