#include <iostream>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <queue>
#include <cstring>

using namespace std;

#define pb push_back
const int maxn = 1e5 + 5;

int n, m, start;
vector <int> arr[maxn];
int dist[maxn];

void bfs(int start) {
    queue<int> Q;

    Q.push(start);
    dist[start] = 0;

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

        for (int i = 0; i < arr[node].size(); i++) {
            if (dist[arr[node][i]] == -1) {
                Q.push(arr[node][i]);
                dist[arr[node][i]] = dist[node] + 1;
            }
        }
    }
}

int main()
{
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);

    cin >> n >> m >> start;
    memset(dist, -1, sizeof(dist));
    /*
    for (int i = 1; i <= n; i++)
        dist[i] = -1;
    */

    for (int i = 0; i < m; i++) {
        int x, y;
        cin >> x >> y;
        arr[x].pb(y);
    }

    bfs(start);

    for (int i = 1; i <= n; i++) {
        cout << dist[i] << " ";
    }

    return 0;
}