#include <bits/stdc++.h>
#define NMAX (100005)

using namespace std;

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

const int f_mare = 2000000;

vector<int> vecini[NMAX];
queue<int> coada;

int dist[NMAX];
int n, m, x, y, s;

int main()
{
    f >> n >> m >> s;

    while (m--)
    {
        f >> x >> y;
        vecini[x].push_back(y);
    }

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

    dist[s] = 0;

    coada.push(s);
    while(!coada.empty())
    {
        x = coada.front();
        coada.pop();

        for (int i = 0; i < vecini[x].size(); i++)
        {
            y = vecini[x][i];
            if (dist[x] + 1 < dist[y])
            {
                dist[y] = dist[x]+1;
                coada.push(y);
            }
        }
    }

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

    return 0;
}