#include <bits/stdc++.h>
using namespace std;

const int N = 100005;

ifstream f("bfs.in");
ofstream g("bfs.out");

vector<int> v[N];
queue<int> q;
int d[N];
int n, m, x, y, i, s;

void bf(int s) {
    d[s] = 1;
    q.push(s);

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

        for(auto it : v[x])
            if(!d[it]) {
                d[it] = d[x] + 1;
                q.push(it);
            }
    }

}

int main()
{
    f >> n >> m >> s;
    for(; m; m--) {
        f >> x >> y;
        v[x].push_back(y);
    }

    bf(s);

    for(i = 1; i <= n; i++)
        g << d[i] - 1 << ' ';

    return 0;
}