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

const int NMAX = 100005;
int n, m, start;
bool fr[NMAX];
int drum[NMAX];
queue <int> coada;
vector <int> graf[NMAX];

void bfs(int i) {

    fr[i] = true;
    coada.push(i);
    drum[i] = 0;

    while(coada.empty() == false){

        int nod = coada.front();
        coada.pop();

        for(size_t i = 0; i < graf[nod].size(); ++i){
            drum[graf[nod][i]] = min(drum[graf[nod][i]], drum[nod] + 1);

            if(fr[graf[nod][i]] == false){
                cout << graf[nod][i] << " ";
                fr[graf[nod][i]] = true;
                coada.push(graf[nod][i]);
            }
        }
    }
}

int main() {
    ifstream fin("bfs.in");
    ofstream fout("bfs.out");
    fin >> n >> m >> start;

    for (int i = 1; i <= m; ++i){
        int a, b;
        fin >> a >> b;
        graf[a].push_back(b);
    }

    for(int i = 1; i < NMAX; ++i)
        drum[i] = INT_MAX;

    bfs(start);

    for(int i = 1; i <= n; ++i){
        if(drum[i] == INT_MAX)
            fout << -1 << " ";
        else
            fout << drum[i] << " ";
    }

    return 0;
}