#include <bits/stdc++.h>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");

int n, m, S, d[100001];
vector <int> G[100001];
queue<int> q;

void BFS(int nod)
{
    int i, curr;
    for (i = 1 ; i <= n ; i++)
        d[i] = 2e9;
    d[nod] = 0;
    q.push(S);
    while (!q.empty())
    {
        curr = q.front();
        q.pop();
        for (auto e : G[curr])
            if (d[e] > d[curr] + 1)
        {
            d[e] = d[curr] + 1;
            q.push(e);
        }
    }
}

int main()
{
    int i, x, y;
    fin >> n >> m >> S;
    for (i = 1 ; i <= m ; i++)
    {
        fin >> x >> y;
        G[x].push_back(y);
    }
    BFS(S);
    for (i = 1 ; i <= n ; i++)
    {
        if (i == S)
            fout << 0 << " ";
        else if (d[i] == 2e9)
            fout << -1 << " ";
        else
            fout << d[i] << " ";
    }
    return 0;
}