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

using namespace std;

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

const int NMAX = 100005;
const int MMAX = 1000005;

int n, m, nod_start;
vector <int> muchii[MMAX];
int distanta[NMAX];
queue <int> coada;

void bfs()
{
    for(int i = 1; i <= n; i++)
        distanta[i] = -1;
    distanta[nod_start] = 0;

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

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

    bfs();

    for(int i = 1; i <= n; i++)
        fout << distanta[i] << " ";

    return 0;
}