#include <bits/stdc++.h>

using namespace std;

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

queue <int> q;
vector <int> g[100005];
int v[100005];

void bfs()
{
    while (!q.empty()) {
        int nod = q.front();
        int N = g[nod].size();
        for (int i = 0; i < N; i ++) {
            int cn = g[nod][i];
            if (v[cn] == -1) {
                v[cn] = v[nod] + 1;
                q.push(cn);
            }
        }
        q.pop();
    }
}

int main()
{
    int n, m, s;
    fin >> n >> m >> s;
    for (int i = 1; i <= m; i ++) {
        int a, b;
        fin >> a >> b;
        g[a].push_back(b);
    }
    for (int i = 1; i <= n; i ++) v[i] = -1;
    v[s] = 0;
    q.push(s);
    bfs();
    for (int i = 1; i <= n; i ++) fout << v[i] << " ";
    return 0;
}