#include <bits/stdc++.h>
#define INF 2e9

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

int n, m, source;
vector<vector<int>> adj;
vector<int> dist;

void BFS(int source)
{
    queue<int> q;
    q.push(source);
    dist[source] = 0;

    while (!q.empty())
    {
        int nod = q.front();
        q.pop();

        for(int i = 0; i < adj[nod].size(); i++)
        {
            int vecin = adj[nod][i];
            if (dist[vecin] > dist[nod]+1)
            {
                dist[vecin] = dist[nod]+1;
                q.push(vecin);
            }
        }
    }
}

int main()
{
    fin >> n >> m >> source;

    adj.resize(n+5);
    dist.resize(n+5);

    for (int i = 1; i <= m; i++)
    {
        int x, y;
        fin >> x >> y;

        adj[x].push_back(y);
        adj[y].push_back(x);
    }

    for (int i = 1; i <= n; i++)
    {
        dist[i] = INF;
    }

    BFS(source);

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