#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

//ifstream fin("omegalul.in");
//ofstream fout("omegalul.out");

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

const long N = 100002, M = 1000002, INF = 2e9;

int n, m, s;

vector <int> a[N];
int viz[N], q[N], d[N];

void cit()
{
    fin>>n>>m>>s;

    for (int i = 1; i <= m; i++)
    {
        int x, y;
        fin>>x>>y;

        a[x].push_back(y);
    }

    for (int i=1; i <= n; i++)
        d[i] = -1;
}

void bfs(int x)
{
    int st = 0, dr = -1;

    q[++dr] = x;

    d[x] = 0;

    while (st <= dr)
    {
        int curent = q[st++];

        for (int i=0; i < a[curent].size(); i++)
        {
            int y = a[curent][i];

            if (d[y] == -1)
            {
                q[++dr] = y;
                d[y] = 1 + d[curent];
            }
        }
    }
}

int main()
{
    cit();

    bfs(s);

    for (int i=1; i <= n; i++)
        fout<<d[i]<<" ";

    return 0;
}