#define NMAX 100005
#include <cstdio>
#include <queue>
#include <vector>
using namespace std;

queue<int> Q;
vector<int> graph[NMAX];
int n, m, s, L[NMAX];

void citire()
{
    int x, y;

    freopen("bfs.in", "r", stdin);
    scanf("%d %d %d", &n, &m, &s);
    for(int i=0; i<m; ++i)
    {
        scanf("%d %d", &x, &y);
        graph[x].push_back(y);
    }
}

void form_L()
{
    Q.push(s);
    L[s] = 1;
    while(!Q.empty())
    {
        int el = Q.front();
        Q.pop();
        for(auto &v:graph[el])
            if(L[v] == 0){
                Q.push(v);
                L[v] = L[el] + 1;
            }
    }

}

void afis()
{
    freopen("bfs.out", "w", stdout);
    for(int i=1; i<=n; ++i)
        printf("%d ", L[i]-1);
}




int main()
{
    citire();
    form_L();
    afis();
    return 0;
}