//
//  main.cpp
//  bfs
//
//  Created by Andu Andu on 29/08/2019.
//  Copyright © 2019 Andu Andu. All rights reserved.
//

#include <fstream>
#include <iostream>
#include <vector>
#include <queue>

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,s;
vector <int> muchii[100005];
int distanta[100005];
queue <int> q;

void bfs() {
    while (!q.empty()) {
        int nod=q.front();
        q.pop();
        for (unsigned int i=0;i<muchii[nod].size();i++) {
            int vecin=muchii[nod][i];
            if (distanta[vecin]==-1) {
                distanta[vecin]=distanta[nod]+1;
                q.push(vecin);
            }
        }
    }
}
int main() {
    fin >> n >> m >> s;
    for (int i=1;i<=m;i++) {
        int x,y;
        fin >> x >> y;
        muchii[x].push_back(y);
        cout<<y<<" ";
    }
    for (int i=1;i<=n;i++) {
        distanta[i]=-1;
    }
    distanta[s]=0;
    q.push(s);
    bfs();
    for (int i=1;i<=n;i++) {
        fout << distanta[i] << " ";
    }
}