#include <bits/stdc++.h>

using namespace std;

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

vector <int> graf[100002];
queue<int> coada;

int lungimi[100002], vizi[100002], n, m, s;

void bfs(int nod)
{
    coada.push(nod);
    vizi[nod] = 1;
    while(!coada.empty())
    {
        int nod_curent = coada.front();
        coada.pop();
        for(auto x : graf[nod_curent])
        {
            if(vizi[x] == 0)
            {
                coada.push(x);
                lungimi[x] = lungimi[nod_curent] + 1;
            }
        }
    }
}

int main()
{
    fin >> n >> m >> s;
    int x, y;
    while(fin >> x >> y)
    {
        graf[x].push_back(y);
    }

    bfs(s);

    for(int i=1; i<=n; ++i)
    {
        if(lungimi[i] ==  0 && i != s)
            fout << "-1 ";
        else fout << lungimi[i] << " ";
    }

    fin.close();
    fout.close();
    return 0;
}