#include <bits/stdc++.h>

using namespace std;

const int kNmax = 1e5 + 5;

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

    vector<int> adj[kNmax];

    int n, m, source;
    fin>>n>>m>>source;

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

    vector<int> d(n + 1);

    for(int i = 1; i <= n; i++) {
        d[i] = -1;
    }

    queue<int> q;
    q.push(source);
    d[source] = 0;

    while(!q.empty()) {
        int nod = q.front();
        for(auto vecin : adj[nod]) {
            if(d[vecin] == -1) {
                d[vecin] = d[nod] + 1;
                q.push(vecin);
            }
        }
        q.pop();
    }

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