#include <iostream>
#include <fstream>
#include <vector>
#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 = 0; i < m; i++) {
        int x, y;
        fin >> x >> y;
        adj[x].push_back(y);
    }
    vector<int> dist(n+1, -1);
    queue<int> q;
    q.push(s);
    dist[s] = 0;
    while (!q.empty()) {
        int v = q.front();
        q.pop();
        int nsz = adj[v].size();
        for (int i = 0; i < nsz; i++) {
            int sz = adj[v][i];
            if (dist[sz] == -1) {
                dist[sz] = dist[v] + 1;
                q.push(sz);
            }
        }
    }
    for (int i = 1; i <= n; i++)
        fout << dist[i] << " ";
    fout << endl;
    fin.close();
    fout.close();
    return 0;
}