#include <bits/stdc++.h>

using namespace std;

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

const int lim = 100005;

int N, M, S;
int Distance[lim];

vector <int> E[lim];
queue <int> q;

void bfs()
{
    int Node, Next;
    while(!q.empty())
    {
        Node =  q.front();
        q.pop();
        for(unsigned int i = 0; i < E[Node].size(); i++)
        {
            Next = E[Node][i];
            if(Distance[Next] == -1)
            {
                q.push(Next);
                Distance[Next] = Distance[Node] + 1;
            }
        }
    }
}

void Read()
{
    f >> N >> M >> S;
    for(int i = 1; i <= M; i++)
    {
        int x, y;
        f >> x >> y;
        E[x].push_back(y);
    }
    for(int i = 1; i <= N; i++)
        Distance[i] = -1;
    Distance[S] = 0;

    q.push(S);

    bfs();

    for(int i = 1; i <= N; i++)
        g << Distance[i] << " ";
}

int main()
{
    Read();
    return 0;
}