#include <bits/stdc++.h>
#define MAX 100000
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
queue <int> Q;
vector <int> v[MAX + 1];
int dist[MAX + 1];
void bfs()
{
    while(!Q.empty())
    {


        int cur = Q.front();
        Q.pop();
        for(int i = 0; i < v[cur].size(); i++)
            if(dist[v[cur][i]] > dist[cur] + 1)
            {
                Q.push(v[cur][i]);
                dist[v[cur][i]] = dist[cur] + 1;
            }
    }
}
int main()
{
    int n, m, s, x, y;
    in>>n>>m>>s;
    for (int i = 1; i <= m; i++)
    {
        in>>x>>y;
        v[x].push_back(y);
        dist[x] = dist[y] = MAX + 2;
    }
    Q.push(s);
    dist[s] = 0;
    bfs();
    for(int i = 1; i <= n; i++)
    {
        if(dist[i] == MAX + 2)
            out<<"-1 ";
        else
            out<<dist[i]<<" ";
    }

    return 0;
}