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

#define NMAX 100010
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n, m, s;
int viz[NMAX];
vector<int>G[NMAX];

void citire();
void bfs();

int main()
{
    citire();
    bfs();
    return 0;
}
void bfs()
{
    int prim = 0, ultim = 0, i, x;
    int coada[NMAX];
    coada[prim] = s;
    viz[s] = 1;
    while(prim <= ultim)
    {
        x = coada[prim++];
        //fout<<x<<' ';
        for(i = 0; i < G[x].size(); i++)
            if(!viz[G[x][i]])
            {
                viz[G[x][i]] = viz[x] + 1;
                coada[++ultim] = G[x][i];
            }
    }
    for(i = 1; i <= n; i++)
        fout << viz[i] - 1 << ' ';
    fout << '\n';
}
void citire()
{
    int i, x, y;
    fin >> n >> m  >> s;
    for(i = 0; i < m; i++)
    {
        fin >> x >> y;
        //adaugam x in lista de adiacenta a lui y;
        //G[y].push_back(x);
        G[x].push_back(y);
    }
}