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

int N,M,S;
vector<int> L[100010];
queue<int> coada;
int cost[100010];

void citire()
{
    scanf("%d%d%d",&N,&M,&S);
    for (int i=1; i<=M; i++)
    {
        int x,y;
        scanf("%d%d",&x,&y);
        L[x].push_back(y);
    }
}

void bfs(int start)
{
    coada.push(start);
    cost[start] = 1;
    while(!coada.empty())
    {
        int x=coada.front();
        coada.pop();
        for(int i=0; i<L[x].size(); i++)
        {
            int y = L[x][i];
            if (cost[y] == 0)
            {
                cost[y] = cost[x] + 1;
                coada.push(y);
            }
        }
    }

}

void afisare()
{
    for (int i=1; i<=N; i++)
        printf("%d ",cost[i]-1);

}

int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    citire();
    bfs(S);
    afisare();
    return 0;
}