#include <iostream>
#include <fstream>
#include <stdio.h>
#include <vector>
#include <cstring>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
const int maxn = 100010;
int n, m, l, s;
vector <int> A[maxn];
int G[maxn], S[maxn], Cost[maxn];
void BFS(int nod)
{
    int i, j;
    memset(Cost, -1, sizeof(Cost));
    l = 1;
    Cost[nod] = 0;
    S[l] = nod;
    for (i = 1; i <= l; i++)
        for (j = 0; j < G[S[i]]; j++)
            if (Cost[A[S[i]][j]] == -1)
            {

                S[++l] = A[S[i]][j];
                Cost[S[l]] = Cost[S[i]] + 1;
            }
}

int main()
{
    int i, x, y;
    f >> n >> m >> s;

    for (i = 1; i <= m; i++)
    {
        f >> x >> y;
        A[x].push_back(y);
    }
    for (i = 1; i <= n; i++)
        G[i] = A[i].size();
    BFS(s);
    for (i = 1; i <= n; i++)
        g << Cost[i] << ' ';
    return 0;
}