dfs

#include <iostream>
#include <set>
#include <vector>
#include <deque>

using namespace std;

vector <vector<int>> g;
vector<bool> used;

void dfs(int h) {
    used[h] = true;
    for (auto e : g[h]) {
        if (!used[e]) dfs(e);
    }
}

int main() {
    int n, m;
    cin >> n >> m;
    g.resize(n);
    int x, y;
    for (int i = 0;i < m;i++)
    {
        cin >> x >> y;
        g[x - 1].push_back(y - 1);
        g[y - 1].push_back(x - 1);
    }
    int start;
    cin >> start;
    used.assign(n, false);
    dfs(start - 1);
    for (auto e : used) cout << (int)e << ' ';
    return 0;
}