#include <bits/stdc++.h>

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");
vector <int> a[100001];
int dist[100001];
int viz[100001];
queue <int> q;
int main()
{
    int first_node, n, m;
    f>>n>>m>>first_node;

    for (size_t i = 0; i < m; i++)
    {
        int x, y;
        f>>x>>y;
        a[x].push_back(y);

    }
    q.push(first_node);
    viz[first_node]=true;
    while (!q.empty())
    {
        int x = q.front();
        q.pop();
        for (auto it : a[x])
        {
            if (viz[it] == 0) {
                q.push(it);
                dist[it] = dist[x] + 1;
                viz[it] = 1;
            }
        
        }
    }

    for (size_t i = 1; i <= n; i++) {
        if(dist[i] != 0 || i == first_node) g<<dist[i]<<" ";
            else g<<"-1 ";

    }

    return 0;
}