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


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

const int MAX_N = 100005;
const int MAX_M = 1000005;

vector<int> G[MAX_N];

void bfs(int start, int dist[])
{
    queue<int> q;
    q.push(start);
    dist[start] = 0;
    while (!q.empty())
    {
        int nod = q.front();
        q.pop();
        for (int vecin : G[nod])
        {
            if (dist[vecin] == -1)
            {
                q.push(vecin);
                dist[vecin] = dist[nod] + 1;
            }
        }
    }
}
int main()
{
    int N, M, S;
    fin >> N >> M >> S;
    for (int i = 0; i < M; ++i)
    {
        int x, y;
        fin >> x >> y;
        G[x].push_back(y);
    }
    int dist[MAX_N];
    for (int i = 0; i <= MAX_N; ++i)
        dist[i] = -1;
    bfs(S, dist);
    for (int i = 1; i <= N; ++i)
        fout << dist[i] << " ";

    return 0;
}