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

using namespace std;

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

#define N 100005

vector < int > L[N];
queue  < int > q;
int d[N];

int n, m, p;

bool viz[N];

void adaugareElemente()
{
    in >> n >> m >> p;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        in >> x >> y;
        L[x].push_back(y);
    }
}

void BFS(int k)
{
    q.push(k);
    while(!q.empty())
    {
        k = q.front();
        q.pop();
        for(int i = 0; i < L[k].size(); i++)
            if(d[L[k][i]] > d[k] + 1 || !viz[L[k][i]])
                d[L[k][i]] = d[k] + 1, q.push(L[k][i]), viz[L[k][i]] = 1;
    }
}

int main()
{
    adaugareElemente();
    viz[p] = 1;
    BFS(p);
    for(int i = 1; i <= n; i++)
        if(viz[i])
            out << d[i] << " ";
        else
            out << -1 << " ";

    return 0;
}