#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

int const NLIM = 100005;
int n, m, s, dist[NLIM];
queue <int> coada;
vector < int > muchii[NLIM];

void BFS()
{
    int nod, vecin;
        while(!coada.empty())
        {
            nod = coada.front();
            coada.pop();
            for(unsigned int i = 0; i<muchii[nod].size(); i++)
            {
                vecin = muchii[nod][i];
                if(dist[vecin] == -1)
                {
                    coada.push(vecin);
                    dist[vecin] = dist[nod] + 1;
                }
            }
        }
}

void citire()
{
    fin >> n >> m >> s;
    for(int i = 1; i<=m; i++)
    {
        int x , y;
        fin >> x >> y;
        muchii[x].push_back(y);
    }

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

    dist[s] = 0;
    coada.push(s);

    BFS();

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

}

int main()
{
    citire();
}