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

using namespace std;

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

vector<int> muchii[1000001];
queue<int> coada;
int distanta[100001];

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

}
int main()
{
    int n, m, nodul_de_inceput;
    fin >> n >> m >> nodul_de_inceput;
    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++)
        distanta[i]=-1;
    distanta[nodul_de_inceput]=0;
    coada.push(nodul_de_inceput);
    bfs(nodul_de_inceput);
    for(int i=1; i<=n; i++)
        fout << distanta[i] <<' ';
}