#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#define nmax 100001

using namespace std;

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

int n, m, s;
int d[nmax];
vector <int > muchii[nmax];
queue <int > coada;

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 (d[vecin] == -1)
            {
                d[vecin] = d[nod] + 1;
                coada.push(vecin);
            }
        }
    }
}

int main()
{
    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++)
        d[i] = -1;
    d[s] = 0;
    coada.push(s);
    bfs();
    for (int i = 1; i <= n; i++)
        fout << d[i] << " ";
    return 0;
}