#include <fstream>
#include <vector>
#include <queue>
///Fiind dat un nod S, sa se determine, pentru fiecare nod X, numarul minim de arce ce trebuie parcurse pentru a ajunge din nodul sursa S la nodul X.

using namespace std;

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

const int NLIM = 100005;
int N, M, S;
int Distance[NLIM];
vector <int> Edge[NLIM];
queue <int> Q;

void BFS()
{
    int Node, Next, i;
    while(!Q.empty())
    {
        Node =  Q.front();
        Q.pop();
        for(i = 0; i < Edge[Node].size(); i++)
        {
            Next = Edge[Node][i];
            if(Distance[Next] == -1)
            {
                Q.push(Next);
                Distance[Next] = Distance[Node] + 1;
            }
        }
    }
}
void Read()
{
    int i;
    fin >> N >> M >> S;
    for(i = 1; i <= M; i++)
    {
        int x, y;
        fin >> x >> y;
        Edge[x].push_back(y);
    }
    for(i = 1; i <= N; i++)
        Distance[i] = -1;
    Distance[S] = 0;
    Q.push(S);
    BFS();
    for(i = 1; i <= N; i++)
        fout << Distance[i] << " ";
}
int main()
{
    Read();
    return 0;
}