#include <bits/stdc++.h>

using namespace std;

string ltrim(const string &);
string rtrim(const string &);
vector<string> split(const string &);



/*
 * Complete the 'order' function below.
 *
 * The function is expected to return an INTEGER_ARRAY.
 * The function accepts following parameters:
 *  1. UNWEIGHTED_INTEGER_GRAPH city
 *  2. INTEGER company
 */

/*
 * For the unweighted graph, <name>:
 *
 * 1. The number of nodes is <name>_nodes.
 * 2. The number of edges is <name>_edges.
 * 3. An edge exists between <name>_from[i] and <name>_to[i].
 *
 */

vector<int> order(int city_nodes, vector<int> city_from, vector<int> city_to, int company) {
      vector <vector<int>> node(city_nodes + 1);
    bool check[10001];
    for (int i = 1; i <= city_nodes; i++)
        check[i] = false;

    for (int i = 0; i < city_nodes; i++) {
        node[city_from[i]].push_back(city_to[i]);
        node[city_to[i]].push_back(city_from[i]);
    }

    vector<int> res;
    queue <int> q;
    q.push(company);
    check[company] = true;
    while (!q.empty()) {
        int spot = q.front();
        q.pop();
        check[spot] = true;
        sort(node[spot].begin(), node[spot].end());
        for (int w : node[spot]) {
            if (!check[w]) {
                res.push_back(w);
                q.push(w);
                check[w] = true;
            }
        }

    }
    return res;
}

int main()
{
    ofstream fout(getenv("OUTPUT_PATH"));

    string city_nodes_edges_temp;
    getline(cin, city_nodes_edges_temp);

    vector<string> city_nodes_edges = split(rtrim(city_nodes_edges_temp));

    int city_nodes = stoi(city_nodes_edges[0]);
    int city_edges = stoi(city_nodes_edges[1]);

    vector<int> city_from(city_edges);
    vector<int> city_to(city_edges);

    for (int i = 0; i < city_edges; i++) {
        string city_from_to_temp;
        getline(cin, city_from_to_temp);

        vector<string> city_from_to = split(rtrim(city_from_to_temp));

        int city_from_temp = stoi(city_from_to[0]);
        int city_to_temp = stoi(city_from_to[1]);

        city_from[i] = city_from_temp;
        city_to[i] = city_to_temp;
    }

    string company_temp;
    getline(cin, company_temp);

    int company = stoi(ltrim(rtrim(company_temp)));

    vector<int> result = order(city_nodes, city_from, city_to, company);

    for (int i = 0; i < result.size(); i++) {
        cout << result[i]<<endl;

        
    }

    fout << "\n";

    fout.close();

    return 0;
}

string ltrim(const string &str) {
    string s(str);

    s.erase(
        s.begin(),
        find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace)))
    );

    return s;
}

string rtrim(const string &str) {
    string s(str);

    s.erase(
        find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
        s.end()
    );

    return s;
}

vector<string> split(const string &str) {
    vector<string> tokens;

    string::size_type start = 0;
    string::size_type end = 0;

    while ((end = str.find(" ", start)) != string::npos) {
        tokens.push_back(str.substr(start, end - start));

        start = end + 1;
    }

    tokens.push_back(str.substr(start));

    return tokens;
}