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

using namespace std;

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

int n;
vector < vector <int> > G(100004);

vector <int> bfs(int start)
{
    queue <int> q;
    q.push(start);
    vector <int> d(n + 1, -1);
    d[start] = 0;
    while (!q.empty())
    {
        int nod = q.front();
        q.pop();
        for (auto vec: G[nod])
        {
            if ((d[vec] > d[nod] + 1) || d[vec] == -1)
            {
                d[vec] = d[nod] + 1;
                q.push(vec);
            }
        }
    }
    return d;
}

int main()
{
    int m, s;

    f >> n >> m >> s;

    for (int i = 1; i <= m; i++)
    {
        int a, b;
        f >> a >> b;
        G[a].push_back(b);
    }
    vector <int> finall(n + 1, -1);

    finall = bfs(s);

    for (int i = 1; i <= n; i++)
        g << finall[i] << " ";

    return 0;
}