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

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

int n, m, s, dist[100005];
vector <int> v[100005];
bool vizitat[100005];

void bfs(int s) {
    queue <int> q;
    q.push(s);
    vizitat[s] = true;
    while (!q.empty()) {
        int nod = q.front();
        for (int i : v[nod]) {
            if (!vizitat[i]) {
                vizitat[i] = true;
                q.push(i);
                dist[i] = dist[nod] + 1;
            }
        }

        q.pop();
    }
}

int main()
{
    fin >> n >> m >> s;
    for (int k = 1; k <= m; ++k) {
        int i, j;
        fin >> i >> j;
        v[i].push_back(j);
    }

    bfs(s);
    for (int i = 1; i <= n; ++i) {
        if (i != s && !dist[i]) fout << -1 << ' ';
        else fout << dist[i] << ' ';
    }
    return 0;
}