#include <fstream>
#include <vector>
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);
        //adj[b].push_back(a);
    }

    vector<int> dist(n+1, -1); // -1, -1, -1, -1, .....

    vector<int> lista(n);
    lista[0] = s;
    dist[s] = 0;

    int i_elso = 0, i_utolso = 0;

    while (i_elso <= i_utolso) {
        int v = lista[i_elso];
        i_elso++;

        int n_sz = adj[v].size();
        for (int i = 0; i < n_sz; i++) {
            int sz = adj[v][i];

            if (dist[sz] == -1) {
                dist[sz] = dist[v] + 1;
                ++i_utolso;
                lista[i_utolso] = sz;
            }
        }
    }

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

    fout << "\n";
    return 0;
}