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

using namespace std;

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

vector<int> G[100001];

int N, M, S;

int dist[100001];

queue<int> Q;

int main()
{
    in >> N >> M >> S;
    for (int i = 1; i <= M; i++)
    {
        int x, y;
        in >> x >> y;
        G[x].push_back(y);
    }
    for (int i = 1; i <= N; i++)
    {
        dist[i] = -1;
    }
    dist[S] = 0;
    Q.push(S);
    while (!Q.empty())
    {
        int nod = Q.front();
        Q.pop();
        for (int i = 0; i < G[nod].size(); i++)
        {
            if (dist[G[nod][i]] == -1)
            {
                dist[G[nod][i]] = dist[nod] + 1;
                Q.push(G[nod][i]);
            }
        }
    }
    for (int i = 1; i <= N; i++)
    {
        out << dist[i] << " ";
    }
    return 0;
}