#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,k;
    int **arce, *minim;
    queue <int> pq;
    fin >> n >> m >> s;
    arce = (int **) calloc(n, sizeof(int *));
    minim = (int *) calloc(n, sizeof(int));
    for( i =0; i <m; i++)
    {
        fin >> x >> y;
        if (x!=y){
        if(arce[x-1] == NULL) arce[x-1] = (int *) calloc(2,sizeof(int));
        else { k = arce[x-1][0]+1;
            arce[x-1] = (int *) realloc(arce[x-1], k*sizeof(int));
        }
        arce[x-1][++arce[x-1][0]] = y-1;
        }
    }
    pq.push(s-1);
    while(!pq.empty())
    {
        x = pq.front();
        pq.pop();
        if(arce[x] != NULL)
        for(i = 1; i<= arce[x][0]; i++)
        {
            if(minim[arce[x][i]] == 0 && arce[x][i] != s-1)
            {
                minim[arce[x][i]] = minim[x] + 1;
                pq.push(arce[x][i]);
            }
        }

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