#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");

#define nMax 100005

int n, m, s, K;
vector<int> v[nMax];
int vn[nMax], cost[nMax], sol[nMax];

void BFS(int s)
{
    int i, j;
    K = 1;
    for (int h = 1; h <= n; h++)
        cost[h] = -1;
    cost[s] = 0;
    sol[K] = s;
    for (i = 1; i <= K; i++){
        for (j = 0; j < vn[sol[i]]; j++){
            if (cost[v[sol[i]][j]] == -1){
                sol[++K] = v[sol[i]][j];
                cost[sol[K]] = cost[sol[i]] + 1;
            }
        }
    }
}

int main()
{
    int x, y;
    f >> n >> m >> s;
    for(int i = 1; i <= m; i++)
    {
        f >> x >> y;
        v[x].push_back(y);
    }
    for (int i = 1; i <= n; i++)
        vn[i] = v[i].size();
    BFS(s);
    for (int i = 1; i <= n; i++)
        g << cost[i] << ' ';
}