#include <bits/stdc++.h>

using namespace std;

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

#define nmax 100005

vector <int> G[nmax];
queue <int> coada;
int n, m, s;

struct pereche{
    bool first;
    int second;
};
pereche viz[nmax];

void bfs(){
    int nod, vecin;
    while(!coada.empty()){
        nod = coada.front();
        coada.pop();

        for(unsigned int i = 0; i < G[nod].size(); i++){
            vecin = G[nod][i];

            if(!viz[vecin].first){
                viz[vecin].first = true;
                viz[vecin].second = viz[nod].second + 1;
                coada.push(vecin);
            }
        }
    }
}

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

    for(int i = 1; i <= n; i++){
        viz[i].second = -1;
    }

    coada.push(s);
    viz[s].second = 0;
    viz[s].first = true;

    bfs();

    for(int i = 1; i <= n; i++){
        fout << viz[i].second << " ";
    }


    return 0;
}