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

using namespace std;

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

const int NMAX = 100005;
vector <int> G[NMAX];
int N, M, s;
int viz[NMAX];
int dist[NMAX];

void read() {
    fin >> N >> M >> s;
    for (int i = 1; i <= M; i++) {
        int x, y;
        fin >> x >> y;
        G[x].push_back(y);
    }
}

queue <int> q;

void bfs() {
    q.push(s);
    viz[s] = 1;
    while (!q.empty()) {
        int nodc = q.front();
        /// cout << nodc << " ";
        q.pop();
        viz[nodc] = 1;
        for (int vecini: G[nodc]) {
            if(!viz[vecini]) {
                q.push(vecini);
                viz[vecini] = 1;
                dist[vecini] = dist[nodc] + 1;
            }
        }

    }

}

int main() {
    read();

    bfs();
    for(int i = 1; i <= N; i++) {
        if (viz[i] == 0) {
            dist[i] = -1;
        }
        cout << dist[i] << ' ';
    }

}