#include <bits/stdc++.h>
using namespace std;

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

pair <int, int> much[1000001];
int last[100001];

int coada[100001], st, dr = -1;
int dist[100001];

int main()
{
    int n, m, s, x, y;
    in >> n >> m >> s;
    for(int i = 1; i <= m; i++)
    {
        in >> x >> y;
        much[i] = {y, last[x]};
        last[x] = i;
    }
    for(int i = 1; i <= n; i++)
        dist[i] = -1;
    dist[s] = 0;
    coada[++dr] = s;
    while(st <= dr)
    {
        int x = coada[st++];
        for(int y = last[x]; y != 0; y = much[y].second)
            if(dist[much[y].first] == -1)
            {
                dist[much[y].first] = dist[x] + 1;
                coada[++dr] = much[y].first;
            }
    }
    for(int i = 1; i <= n; i++)
        out << dist[i] << " ";
    return 0;
}