#include <bits/stdc++.h>
///#pragma GCC optimize("O1")

using namespace std;

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

vector < int > v[100005];
queue < int > q;

int viz[100005];

void bfs(int nod)
{
    int nd;
    q.push(nod);
    while (!q.empty())
    {
        nd = q.front();
        q.pop();
        for (auto &it : v[nd])
        {
            if (!viz[it])
            {
                q.push(it);
                viz[it] = viz[nd] + 1;
            }
        }
    }
}

int main()
{
    int n, m, nod, i, x, y;

    fin >> n >> m >> nod;

    for (i = 1; i <= m; ++i)
    {
        fin >> x >> y;
        v[x].emplace_back(y);
    }

    viz[nod] = 1;
    bfs(nod);

    for (i = 1; i <= n; ++i)
    {
        if (i == nod) fout << 0 << ' ';
        else if (viz[i]) fout << viz[i] - 1 << ' ';
        else fout << "-1 ";
    }

    return 0;
}