#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

vector<vector<int>> ad;

void ConstrListaN(int &m)
{
    int i, j;
    for (int k = 0; k < m; k++)
    {
        f >> i >> j;
        ad[i].push_back(j);
    }
}

vector<int> BFS(int start, int n)
{
    queue<int> q;
    vector<int> dist(n + 1, -1);
    q.push(start);
    dist[start] = 0;

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

        for (int i : ad[nod_curent])
        {
            if (dist[i] == -1)
            {
                dist[i] = dist[nod_curent] + 1;
                q.push(i);
            }
        }
    }
    return dist;
}

int main()
{
    int n, m, s;
    f >> n >> m >> s;
    ad.resize(n + 1);
    ConstrListaN(m);
    vector<int> dist = BFS(s, n);

    for (int i = 1; i <= n; i++)
        g << dist[i] << " ";

    f.close();
    g.close();
    return 0;
}