#include <iostream>
#include <bits/stdc++.h>

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

queue <int> Q;
vector <list < int > > L;
int tata[120000]={0}, vizitat[120000]={0}, dist[120000]={0};

void BFS(int s)
{
    int x;
    Q.push(s);
    tata[s] = s;
    vizitat[s] = 1;
    while (!Q.empty())
    {
        x = Q.front();
        Q.pop();
        cout << x << " ";
        for (auto a:L[x])
        {
            if (!vizitat[a])
            {
                Q.push(a);
                vizitat[a] = 1;
                tata[a] = x;
                dist[a] = dist[x] + 1;
            }
        }
    }
}

int main()
{
    int n,m,s,x,y;
    fin >> n >> m >> s;
    L.resize(n+1);
    for (int i = 0; i < m; i++)
    {
        fin >> x >> y;
        L[x].push_back(y);
    }
    BFS(s);
    for (int i = 1; i <= n; i++)
        if (!vizitat[i])
            fout << -1 << " ";
        else fout << dist[i] << " ";
    return 0;
}