#include <iostream>
#include <vector>
#include <cstdio>

using namespace std;

vector<int> out [100001];
int viz[100001];
int dist[100001];
int queue[100001];
int queueSize;
int indiceInQueue;

int main()
{
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);
    int s, n, m;
    scanf("%d", &n);
    scanf("%d", &m);
    scanf("%d", &s);
    dist[s] = 0;
    for(int i = 1; i <= m; ++i)
    {
        int a, b;
        scanf("%d", &a);
        scanf("%d", &b);
        out[a].push_back(b);
    }
    for(int i = 1; i <= n; ++i)
        dist[i] = -1;
    queue[0] = s;
    dist[s] = 0;
    ++queueSize;
    while(indiceInQueue != queueSize)
    {
        int vertex1 = queue[indiceInQueue];
        for(int i = 0; i < out[vertex1].size(); ++i)
        {
            int vertex2 = out[vertex1][i];
            if(dist[vertex2] == -1)
            {
                queue[queueSize++] = vertex2;
                dist[vertex2] = dist[vertex1] + 1;
            }
        }
        ++indiceInQueue;
    }

    for(int i = 1; i <= n; ++i)
        printf("%d ", dist[i]);

    return 0;
}