#include <bits/stdc++.h>

using namespace std;

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

int n, m, s, dist[100001];
vector <int> vecini[100001];
void bfs(int start)
{
    for (int i=1;i<=n;i++)
        dist[i] = -1;
    queue <int> q;
    q.push(start);
    dist[start] = 0;

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

        for (auto j : vecini[i])
            if (dist[j] == -1)
            {
                dist[j] = dist[i] + 1;
                q.push(j);
            }

    }
}

int main()
{
    f>>n>>m>>s;
    for (int i=1; i<=m; i++)
    {
        int x, y;
        f>>x>>y;
        vecini[x].push_back(y);
    }

    bfs(s);

    for (int i=1;i<=n;i++)
        g<<dist[i]<<" ";
}