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

using namespace std;

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

const int NMAX = 100001;

int q[NMAX], dist[NMAX];
vector<int> adj[NMAX];

void BFS(int start) {
    for (int i = 0; i < NMAX; i++) {
        dist[i] = -1;
    }
    int qsize = 0;
    q[qsize++] = start;
    dist[start] = 0;
    for (int i = 0; i < qsize; i++) {
        for (int nod : adj[q[i]]) {
            if (dist[nod] == -1) {
                q[qsize++] = nod;
                dist[nod] = dist[q[i]] + 1;
            }
        }
    }
}

int main() {
    int n, m, s;
    fin >> n >> m >> s;
    for (int i = 0; i < m; i++) {
        int x, y;
        fin >> x >> y;
        adj[x].push_back(y);
    }
    fin.close();
    BFS(s);
    for (int i = 1; i <= n; i++) {
        fout << dist[i] << " ";
    }
    fout << '\n';
    fout.close();
    return 0;
}