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

using namespace std;

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

int n, m, s;
vector<vector<int>> g;
vector<int> d;

void bfs(int node) {
    queue<int> q;

    d[node] = 1;
    q.push(node);

    while (!q.empty()) {
        int cur = q.front();
        q.pop();

        for (const int& i : g[cur]) {
            if (!d[i]) {
                d[i] = d[cur] + 1;
                q.push(i);
            }
        }
    }
}

int main(){
    fin >> n >> m >> s;
    g = vector<vector<int>>(n + 1);
    d = vector<int>(n + 1, 0);

    int x, y;
    for (int i = 1; i <= m; i++) {
        fin >> x >> y;
        g[x].push_back(y);
    }

    bfs(s);

    for (int i = 1; i <= n; i++) {
        fout << d[i] - 1 << ' ';
    }

    return 0;
}