#include <fstream>

#include <vector>

#include <queue>

#include <cstring>

using namespace std;

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

const int NMAX = 100005;

int n, m, start;
int distante[NMAX];

vector <int> muchii [NMAX];
queue <int> coada;

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

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

int main() {
    fin >> n >> m >> start;
    for (int i = 0; i <= n; i++)
        distante[i] = -1;
    for (int i = 1; i <= m; i++) {
        int x, y;
        fin >> x >> y;
        muchii[x].push_back(y);
    }

    coada.push(start);
    distante[start] = 0;
    BFS();

    for (int i = 1; i <= n; i++)
        fout << distante[i] << ' ';
    return 0;
}