#include <iostream>
#include <fstream>
#include <bits/stdc++.h>

using namespace std;

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

int N, M;
const int Nmax = 10001;
int distanta[Nmax];

vector<int> graf[Nmax];
queue<int> q;

void BFS()
{
    int nod, vecini;
    while(!q.empty())
    {
        nod = q.front();
        q.pop();
        for(int i = 0; i<graf[nod].size(); i++)
        {
            vecini = graf[nod][i];
            if(distanta[vecini] == -1)
            {
                distanta[vecini] = distanta[nod]+1;
                q.push(vecini);
            }
        }
    }
}

void citire()
{
    int X;
    fin>>N>>M>>X;
    for(int i = 1; i<=M; i++)
    {
        int x, y;
        fin>>x>>y;
        graf[x].push_back(y);
    }
    for(int i = 1; i<=N; i++)
        distanta[i] = -1;
    distanta[X] = 0;
    q.push(X);
    BFS();
    for(int i = 1; i<=N; i++)
        fout<<distanta[i]<<" ";
}

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