#include <bits/stdc++.h>

using namespace std;

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

int main()
{
    int n, m, s;
    fin >> n >> m >> s;
    vector<vector<int>> v(n + 1);

    vector<int> dist(n + 1, -1);
    dist[s] = 0;


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

    queue<int> q;
    q.push(s);

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

        for (auto it : v[x])
        {
            if (dist[it] == -1)
            {
                dist[it] = dist[x] + 1;
                q.push(it);
            }
        }
    }

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




    return 0;
}