#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1e5 + 2;
const int INF = 1e8 ;
vector <int> g[MAXN];
int dist[MAXN];

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

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

    for(int i = 1; i <= n; ++i){
        if(i != s) dist[i] = INF;
    }

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

    while(q.size()){

        int node = q.front();
        q.pop();

        for(auto y : g[node]){
            if(dist[y] > dist[node] + 1){
                dist[y] = dist[node] + 1;
                q.push(y);
            }
        }
    }

    for(int i = 1; i <= n; ++i){
        if(dist[i] == INF) dist[i] = -1;
        fout << dist[i] << ' ' ;
    }

    return 0;
}