#include <fstream>
#include <vector>
#include <queue>
#define N 100005

using namespace std;

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

int n, m, viz[N], dist[N], prim, s;
vector <int> muchii[N];
queue <int> C;

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

    }
}

void BFS()
{
    int i,x;
    while (C.empty() != 0)
    {
        prim = C.front();
        C.pop();
        for (i = 0; i < muchii[prim].size(); i++)
        {
            x = muchii[prim][i];
            if (viz[x] == 0)
            {
                C.push(x);
                dist[x] = dist[prim] + 1;
                viz[x] = 1;
            }
        }
    }
}


void Rezolvare()
{
    int i;
    C.push(s);
    viz[s] = 1;
    for (i = 1; i <= n; i++)
        dist[i] = -1;
    dist[s] = 0;
    BFS();
    for (i = 1; i <= n; i++)
        fout << dist[i] << " ";
}


int main()
{
    Citire();
    Rezolvare();
}