#include <iostream>
#include <vector>
#include <queue>
#include <fstream>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");

queue <int> coada;
vector <int> A[100010];
int dis[100010];

void BFS() {
    int nod;
    while(!coada.empty()) {
        nod = coada.front();
        coada.pop();

        for (unsigned int i = 0; i <= A[nod].size(); ++i) {
            int vecin = A[nod][i];
            if (dis[vecin] == -1) {
                dis[vecin] = dis[nod] + 1;
                coada.push(vecin);
            }
        }
    }
}

int main() {
    int n, m, x, y, start;
    fin >> n >> m >> start;
    for (int i = 1; i <= m; ++i) {
        fin >> x >>  y;
        A[x].push_back(y);
    }
    for (int i = 1; i <= n; ++i) {
        dis[i] = -1;
    }
    dis[start] = 0;
    coada.push(start);
    BFS();
    for (int i = 1; i <= n; ++i) {
        fout << dis[i] << " ";
    }
}