#include <bits/stdc++.h>

using namespace std;

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

int n, m, s, a, b, seen;
vector< vector<int> > lv;
vector<int> dist;
vector<bool> visited;

void bfs(int s)
{
    // node, depth
    deque<pair<int, int>> dq;

    dq.push_back({s, 0});
    visited[s] = true;

    while (!dq.empty())
    {
        pair<int, int> p = dq.front();
        dq.pop_front();

        dist[p.first] = p.second;
        visited[p.first] = true;

        for (auto next : lv[p.first])
            if (!visited[next])
                dq.push_back({ next, p.second + 1 });
    }
}

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

    lv.resize(n + 1);
    dist.resize(n + 1, -1);
    visited.resize(n + 1, 0);

    while (m--)
        f >> a >> b,
        lv[a].push_back(b);

    bfs(s);

    for (int i = 1; i < dist.size(); ++i)
        g << dist[i] << ' ';

    return 0;
}