#include <fstream>
#include <queue>
#include <vector>

#define NMAX 100000

#define INFINITY (1<<30)

#define VISITED 1
#define NOTVISITED 0


void bfs(int source, std::vector<int> adj[], int n, int dist[])
{
    int vis[NMAX];
    std::queue<int> q;

    for (int i = 0; i < n; ++i) {
        vis[i] = NOTVISITED;
        dist[i] = INFINITY;
    }

    dist[source] = 0;
    vis[source] = VISITED;

    q.push(source);

    while (!q.empty()) {
        auto node = q.front();
        q.pop();

        for (auto neigh : adj[node]) {
            if (!vis[neigh]) {
                dist[neigh] = dist[node] + 1;
                q.push(neigh);
            }
        }
    }
}

int main()
{
    std::ifstream fin("bfs.in");
    std::ofstream fout("bfs.out");

    int n, m, source;
    std::vector<int> adj[NMAX];
    int dist[NMAX];


    fin >> n >> m >> source;

    --source;

    for (int v, w, i = 0; i < m; ++i) {
        fin >> v >> w;
        --v;
        --w;
        adj[v].push_back(w);
        adj[w].push_back(v);
    }


    bfs(source, adj, n, dist);


    for (int i = 0; i < n; ++i) {
        if (dist[i] == INFINITY)
            fout << -1 << ' ';
        else
            fout << dist[i] << ' ';
    }

    fout << '\n';

    fin.close();
    fout.close();

    return 0;
}