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

using namespace std;

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

int n, m, s;
vector <int> Graph[100005];

void bfs(int nod)
{
    vector <int> d(n + 1, -1);
    queue <int> q;
    q.push(nod);
    d[nod] = 0;
    while (!q.empty())
    {
        int u = q.front();
        q.pop();
        for (const auto& val : Graph[u])
            if (d[val] == -1)
            {
                d[val] = d[u] + 1;
                q.push(val);
            }
    }
    d.erase(d.begin());
    for (const auto& val : d)
        g << val << " ";

}

int main()
{
    int x, y;
    f >> n >> m >> s;
    while(m--)
    {
        f >> x >> y;
        Graph[x].push_back(y);
    }
//    is.resize(n + 1);
    bfs(s);
}