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

using namespace std;

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

int n, m, s, x, y;
int dist[100001];
bool u[100001];
vector < int > v[100001];

void bfs(int nod)
{
    queue < int > coada;
    u[nod] = 1;
    coada.push(nod);
    while (!coada.empty())
    {
        nod = coada.front();
        for (int i=0; i<v[nod].size(); i++)
            if (!u[v[nod][i]])
            {
                dist[v[nod][i]] = dist[nod] + 1;
                u[v[nod][i]] = 1;
                coada.push(v[nod][i]);
            }
        coada.pop();
    }
}

int main()
{
    f >> n >> m >> s;
    for (int i=1; i<=m; i++)
    {
        f >> x >> y;
        v[x].push_back(y);
    }

    bfs(s);

    for (int i=1; i<=n; i++)
    {
        if (!u[i])
            dist[i] = -1;
        g << dist[i] << " ";
    }

    return 0;
}