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

using namespace std;

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

vector <int> v[100];
queue <int> q;

int n, m, x, y, s, l, c[100000], d[100000];

void bfs (int s) {
    c[s] = 1;
    for (int i = 1; i <= n; i++) {
        d[i] = -1;
    }
    d[s] = 0;
    while (!q.empty()) {
        int x = q.front();
        q.pop();
        int size = v[x].size();
        for (int i = 0; i < size; i++) {
            int y = v[x][i];
            if (!c[y]) {
                c[y]++;
                d[y] = d[x] + 1;
                q.push(y);
            }
        }
    }
}

int main () {
    fin >> n >> m >> s;
    for (int i = 1; i <= m; i++) {
        fin >> x >> y;
        v[x].push_back(y);
    }
   q.push(s);
   bfs(s);
    for (int i = 1; i <= n; i++) {
        fout << d[i] << " ";
    }
}