#include <fstream>
#include <iostream>
#include <vector>
#include <queue>
#define INF 999999999
#define NMAX 100005
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector<vector<int>> gr;
queue<int> q;
int N, M, node;
int d[NMAX];
void read() {
    int x, y;
    fin >> N >> M >> node;
    gr.resize(N + 1);
    for (int i = 0; i < M; ++i) {
        fin >> x >> y;
        gr[x].push_back(y);
    }
}
void setd() {
    for (int i = 0; i <= N; ++i) {
        d[i] = INF;
    }
}
void bfs() {
    int nod = node;
    d[nod] = 0;
    q.push(nod);
    while (!q.empty()) {
        nod = q.front();
        q.pop();
        for (auto x : gr[nod]) {
            if (d[x] > d[nod] + 1) {
                d[x] = d[nod] + 1;
                q.push(x);
            }
        }
    }
}
void afis() {
    for (int i = 1; i <= N; ++i) {
        if (d[i] == INF) {
            fout << -1 << " ";
        }
        else {
            fout << d[i] << " ";
        }
    }
}
int main()
{
    read();
    setd();
    bfs();
    afis();
    return 0;
}