#include <fstream>

using namespace std;

ifstream in("bfs.in");
ofstream out("bfs.out");

const int N = 100001, M = 1000001;

int lst[N], urm[2 * M], vf[2 * M], st, dr;
int d[N], q[N];
int nr = 0;


void adauga(int x, int y)
{
    //il adauga pe y in lista de adiacenta a lui x
    ++nr;
    vf[nr] = y;
    urm[nr] = lst[x];
    lst[x] = nr;
}

void bfs(int x0, int n)
{
    int x, y;
    for(int i = 1; i <= n; i++)
    {
        d[i] =-1;
    }
    st = 0;
    dr = -1;
    q[++dr] = x0;
    d[x0] = 0;
    while(st <= dr)
    {
        x = q[st++];
        for(int p = lst[x]; p!= 0; p = urm[p])
        {
            y = vf[p];
            if(d[y] == -1)
            {
                q[++dr] = y;
                d[y] = 1 + d[x];
            }
        }
    }
}

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

        in >> x >> y;
        adauga(x, y);
    }
    bfs(s,n);
    for(int i = 1; i <= n; i++)
    {
        out << d[i] << ' ';
    }
    return 0;
}