#include <fstream>
#include <queue>
#include <stdlib.h>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int main()
{
    int n ,m ,s, i, x, y;
    int **arce, *minim;
    queue <int> pq;
    fin >> n >> m >> s;
    arce = (int **) calloc(n, sizeof(int *));
    minim = (int *) calloc(n, sizeof(int));
    for( i =1; i <=m; i++)
    {
        fin >> x >> y;
        if (x!=y){
        if(arce[x] == NULL) arce[x] = (int *) calloc(n,sizeof(int));
        arce[x][++arce[x][0]] = y;
        }
    }
    pq.push(s);
    while(!pq.empty())
    {
        x = pq.front();
        pq.pop();
        for(i = 1; i<= arce[x][0]; i++)
        {
            if(minim[arce[x][i]] == 0 && arce[x][i] != s)
            {
                minim[arce[x][i]] = minim[x] + 1;
                pq.push(arce[x][i]);
            }
        }

    }
    for( i = 1; i <= n; i++)
    {
        if( i !=s && minim[i] == 0) fout<<"-1 ";
        else fout << minim[i] <<" ";
    }
    return 0;
}