#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#include <fstream>
using namespace std;

int N, M, S;

vector <int> lista[100];
int cost[100];
int coada[100];

void BFS(int nod)
{
    memset(cost, -1, sizeof(cost));
    cost[nod] = 0;
    int dim = 1;
    coada[dim] = nod;
    for(int i = 1; i <= dim; ++i)
        for(int j = 0; j < lista[coada[i]].size(); ++j)
        {
            if(cost[lista[coada[i]][j]] == -1){
                coada[++dim] = lista[coada[i]][j];
                cost[coada[dim]] = cost[coada[i]] + 1;
            }
        }
}

int main()
{
    ifstream f("bfs.in");
    ofstream g("bfs.out");
    f >> N >> M >> S;
    for(int i = 1; i <= M; ++i)
    {
        int a, b;
        f >> a >> b;
        lista[a].push_back(b);
    }
    BFS(S);
    for(int i = 1; i <= N; ++i)
        g << cost[i] << " ";
    return 0;
}