#include <bits/stdc++.h>
#define INF 1e9
using namespace std;
int n, m, s, x, y;
vector <int> a[100005];
int d[100005];
queue <int> Q;
int main()
{
    int i, j, x;
    ifstream cin("bfs.in");
    ofstream cout("bfs.out");
    cin >> n >> m >> s;
    for (i = 1; i <= m; i++)
    {
        cin >> x >> y;
        a[x].push_back(y);
    }
    for (i = 1; i <= n; i++)
        d[i] = INF;

    Q.push(s);
    d[s] = 0;
    while (!Q.empty())
    {
        x = Q.front();
        Q.pop();
        for (i = 0; i < a[x].size(); i++)
        {
            if (d[a[x][i]] > d[x] + 1)
            {
                d[a[x][i]] = d[x] + 1;
                Q.push(a[x][i]);
            }
        }
    }
    for (i = 1; i <= n; i++)
        if (d[i] != INF)
            cout << d[i] << " ";
        else cout << "-1 ";

    return 0;
}