#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n, m, s;
vector<int> adj[100001];
queue<int> coada;
int answer[100002];
int main() {
    f >> n >> m >> s;
    for(int i = 0; i < n; i++)
        answer[i + 1] = -1;
    for(int i = 0; i < m; i++)
    {
        int x,y;
        f >> x >> y;
        adj[x].push_back(y);
    }
    coada.push(s);
    answer[s] = 0;
    while(!coada.empty())
    {   int front = coada.front();
        for(auto x : adj[front])
        {
            if(answer[x] == -1)
            {
                answer[x] = answer[front] + 1;
                coada.push(x);
            }
        }
        coada.pop();
    }
    for(int i = 0; i < n; i++)
        g << answer[i + 1] << " ";
    return 0;
}