#include <bits/stdc++.h>

using namespace std;

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

const int NMAX = 1e5 + 7;

int n, m, start;
vector<vector<int>> v(NMAX);
vector<bool> ok(NMAX);
vector<int> dist(NMAX, -1);

int main()
{
    fin >> n >> m >> start;

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

    queue<int> q;
    q.push(start);
    ok[start] = true;
    dist[start] = 0;


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

        for (auto it: v[nod])
        {
            if (!ok[it])
            {
                q.push(it);
                dist[it] = dist[nod] + 1;
                ok[it] = true;
            }
        }
    }

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

    return 0;
}