#include <bits/stdc++.h>
#define ll long long
#pragma GCC optimize ("O3")
#define f first
#define s second
#define pb push_back
#define pii pair<int, int>
using namespace std;

const int INF = 1e9;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    ifstream cin ("bfs.in");
    ofstream cout ("bfs.out");

    int n, m, s;
    cin >> n >> m >> s;

    vector <vector <int>> adj(n + 2);
    vector <int> dist(n + 2, INF);

    for (int i = 1; i <= m; i ++) {
        int u, v; cin >> u >> v;
        adj[u].pb(v);
    }

    queue <int> q;
    q.push(s);
    dist[s] = 0;

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


        for (auto to : adj[node]) {
            if (dist[to] != INF) continue;

            dist[to] = dist[node] + 1;
            q.push(to);
        }
    }

    for (int i = 1; i <= n; i ++) cout << (dist[i] == INF ? -1 : dist[i]) << " ";

    return 0;
}