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

using namespace std;

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

const int NMax = 50000;
queue <int> coada;
vector <int> v[NMax];
int viz[NMax], c[NMax];
int n, m, s;

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

void AfisareGraph()
{
    for(int i = 1; i <= n; i++)
    {
        fout << i << ": ";
        for(auto j : v[i])
            fout << j << " ";
        fout << endl;
    }
}

void BFS(int a)
{
    coada.push(a);
    viz[a] = 1;
    for(int i = 1; i <= n; i++)
        c[i] = -1;
    c[a] = 0;
    while(!coada.empty())
    {
        int d = coada.front();
        for(auto j : v[d])
            if(viz[j] == 0)
        {
            viz[j] == 1;
            coada.push(j);
            c[j] = c[d] + 1;
        }
        coada.pop();
    }
}

int main()
{
    citire();
    //AfisareGraph();
    BFS(s);
    for(int i = 1; i <= n; i++)
        fout << c[i] << " ";
    return 0;
}