#include <vector>
#include <queue>
#include <fstream>
using namespace std;

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

vector<vector<int>> adj;
vector<int> dist;

void bfs(int s)
{
    queue<int> q;
    q.push(s);
    dist[s] = 0;

    while (!q.empty())
    {
        int nod = q.front();
        q.pop();

        for (int vecin : adj[nod])
        {
            if (dist[vecin] == -1)
            {
                dist[vecin] = dist[nod] + 1;
                q.push(vecin);
            }
        }
    }
}

int main()
{
    int n, m, s;
    f >> n >> m >> s;

    adj.resize(n + 1);
    dist.assign(n + 1, -1);

    int x, y;
    while (m--)
    {
        f >> x >> y;
        adj[x].push_back(y); // graf orientat
    }

    bfs(s);

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

    return 0;
}