#include    <iostream>
#include    <fstream>
#include    <bits/stdc++.h>
using namespace std;

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

const int MAX = 100001;
int N, M, S;
int Distance[MAX];
vector <int> lista_ad[MAX];
queue <int> Q;

void BFS()
{
    int nod, vecin;
    while(!Q.empty())
    {
        nod =  Q.front();
        Q.pop();
        for(int i = 0; i < lista_ad[nod].size(); i++)
        {
            vecin = lista_ad[nod][i];
            if(Distance[vecin] == -1)
            {
                Q.push(vecin);
                Distance[vecin] = Distance[nod] + 1;
            }
        }
    }
}
void Read()
{
    fin >> N >> M >> S;
    for(int i = 1; i <= M; i++)
    {
        int x, y;
        fin >> x >> y;
        lista_ad[x].push_back(y);
    }
    for(int i = 1; i <= N; i++)
        Distance[i] = -1;
    Distance[S] = 0;
    Q.push(S);
    BFS();
    for(int i = 1; i <= N; i++)
        fout << Distance[i] << " ";
}
int main()
{
    Read();
    return 0;
}