#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

const int INF = 0x3f3f3f3f;
int n, m, S;
vector<vector<int>> G;
vector<int> D;
queue<int> Q;

void Read();
void BFS();
void Write();

int main() {
    Read();
    BFS();
    Write();
    fin.close();
    fout.close();
    return 0;
}

void BFS() {
    D[S] = 0;
    Q.push(S);
    int x;
    while (!Q.empty()) {
        x = Q.front(); Q.pop();
        for (const int & e : G[x])
            if (D[e] == INF) {
                Q.push(e);
                D[e] = D[x] + 1;
            }
    }
}

void Write() {
    for (int i = 1; i <= n; i++)
        if (D[i] == INF) fout << "-1 ";
        else fout << D[i] << " ";
}

void Read() {
    fin >> n >> m >> S;
    G = vector<vector<int>>(n + 1);
    D = vector<int>(n + 1, INF);
    for (int i = 0, x, y; i < m; i++) {
        fin >> x >> y;
        G[x].push_back(y);
    }
}