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

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

int n, m, S, viz[100002], jump[100002];
vector<int> L[100002];

void Citire()
{
    int i, x, y;
    fin >> n >> m >> S;
    for (i = 1; i <= m; i++)
    {
        fin >> x >> y;
        L[x].push_back(y);
    }
}

void BFS(int sursa)
{
    int k;
    for (k = 1; k <= n; k++)
        jump[k] = 2e9;
    queue<int> Q;
    Q.push(sursa);
    jump[sursa] = 0;
    while (!Q.empty())
    {
        k = Q.front();
        Q.pop();
        if (viz[k] == 0)
        {
            viz[k] = 1;
            for (auto e : L[k])
            {
                if (jump[e] > jump[k] + 1) jump[e] = jump[k] + 1;
                Q.push(e);
            }
        }
    }
}

void Driver()
{
    BFS(S);
    for (int i = 1; i <= n; i++)
        jump[i] != 2e9 ? fout << jump[i] << ' ' : fout << "-1 ";
}

int main()
{
    Citire();
    Driver();
    fin.close();
    fout.close();
    return 0;
}