#include <iostream>
#include <fstream>
#include <queue>
using namespace std;

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

    int n, m, s;
    fin >> n >> m >> s;

    vector<vector<int>> adj(n+1);

    for (int i = 1; i <= m; i++) {
        int a, b;
        fin >> a >> b;
        adj[a].push_back(b);
    }

    vector<int> dist(n+1, -1);
    dist[s] = 0;

    queue<int> q;
    q.push(s);

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

        for (auto szomszed : adj[v]) {
            if (dist[szomszed] == -1) {
                dist[szomszed] = dist[v]+1;
                q.push(szomszed);
            }
        }
    }

    for (int i = 1; i <= n; i++)
        fout << dist[i] << " ";
    fout << "\n";
    return 0;
}