#include <fstream>
#include <algorithm>
#include <queue>
#include <iostream>
#define NMAX 1000000

using namespace std;

struct elem {
    int x, y;
};

ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n, m, marc[NMAX], cost[NMAX], start;
elem vect[NMAX];

queue <int> q;

void citire() {
    int i, x, y;
    fin >> n >> m >> start;
    for (i = 1; i <= m; i++)
        fin >> vect[i].x >> vect[i].y;
    fin.close();
}

void bfs(int start) {
    int i, p;
    marc[start] = 1;
    cost[start] = 0;
    q.push(start);
    while (!q.empty()) {
        p = q.front();
        q.pop();
        // vizitam toti vecinii punctului scos din coada
        for (i = 1; i <= m; i++)
            if (vect[i].x == p and not marc[vect[i].y]) {
                q.push(vect[i].y); marc[vect[i].y] = 1; cost[vect[i].y] = cost[vect[i].x] + 1;
            }
    }
}

void setcost() {
    for (int i = 1; i <= n; i++)
        cost[i] = -1;
}

void afiscost() {
    for (int i = 1; i <= n; i++)
        fout << cost[i] << ' ';
}

int main() {
    citire();
    setcost();
    bfs(start);
    afiscost();
    fout.close();
    return 0;
}