#include <iostream>
#include <fstream>

using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");

const int N = 100001, M = 1000001;
int lst[N], vf[2*M], urm[2*M], nr=0, dist[N], q[N];

void Add(int x, int y);

int main()
{
    int n, m, s;
    in >> n >> m >> s;
    for(int i=0; i<m; i++)
    {
        int x, y;
        in >> x >> y;
        Add(x, y);
    }

    for(int i=1; i<=n; i++) dist[i]=-1;

    int st=0, dr=-1;
    dist[s]=0;
    q[++dr]=s;
    while(st<=dr)
    {
        int x = q[st++];//extragem primul nod din coada
        for(int p=lst[x];p;p=urm[p])
        {
            int y=vf[p];
            if(dist[y]==-1)
            {
                q[++dr]=y;
                dist[y]=dist[x]+1;
            }
        }
    }

    for(int i=1; i<=n; i++)
        out << dist[i] << ' ';
    return 0;
}

void Add(int x, int y)
{
    ++nr;
    vf[nr]=y;
    urm[nr]=lst[x];
    lst[x]=nr;
}