#include <bits/stdc++.h>

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

int m, n, s, x, y, dist[100005];
vector <int> v[100005];
queue <int> q;

void bfs(){
    while(q.empty() == 0){
        int nod = q.front();
        for(int k = 0; k < v[nod].size(); k++){
            int nodToViz = v[nod][k];
            if(dist[nodToViz] == 0){
                dist[nodToViz] = dist[nod] + 1;
                q.push(nodToViz);
            }
        }
        q.pop();
    }
}


int main()
{
    f >> n >> m >> s;
    for(int i = 1; i <= m; i++){
        f >> x >> y;
        v[x].push_back(y);
    }

    q.push(s);
    dist[s] = 1;
    bfs();

    for(int i = 1; i <= n; i++){
        g << dist[i] - 1 << " ";
    }
    return 0;
}