#include <bits/stdc++.h>

using namespace std;

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

int n, s, d[100005], viz[100005];
vector <int> h[100005];

void Citire()
{
    int m, x, y;
    fin >> n >> m >> s;
    while (m--)
    {
        fin >> x >> y;
        h[x].push_back(y);
    }
    fin.close();
}

void BFS(int k)
{
    int dist;
    queue <pair <int, int>> q;
    q.push({k, 0});
    viz[k] = 1;
    while (!q.empty())
    {
        k = q.front().first;
        dist = q.front().second;
        d[k] = dist;
        q.pop();
        for (int w : h[k])
            if (!viz[w])
            {
                viz[w] = 1;
                q.push({w, dist + 1});
            }
    }
}

int main()
{

    Citire();
    BFS(s);
    for (int i = 1; i <= n; i++)
        if (d[i] > 0 || i == s) fout << d[i] << " ";
        else fout << "-1 ";
    fout.close();

    return 0;
}