#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX_N 100005


using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
vector<int> graf[MAX_N];
int visited[MAX_N];
int dist[MAX_N];
void bfs(int s)
{
    queue<pair<int,int>> q;
    q.push(make_pair(s, 0));
    visited[s] = 1;
    while (!q.empty())
    {

        pair<int,int> cur = q.front();
        printf("%d ", cur.first);
        q.pop();
        dist[cur.first] = cur.second;
        for (int i = 0; i < graf[cur.first].size(); i++)
        {
            int neighbour = graf[cur.first][i];
            if (!visited[neighbour])
            {
                visited[neighbour] = 1;
                q.push(make_pair(neighbour, cur.second + 1));
            }
        }
    }
}
void afisare(int n)
{
    for (int i = 1; i <= n; i++)
    {
        out << dist[i] << " ";

    }
}
int main()
{
    int n,m,s;
    in >> n >> m >> s; 
    int x, y;
    for (int i = 0; i < m; i++)
    {
        in >> x >> y;
        graf[x].push_back(y);
    }
    memset(dist, -1, MAX_N);
    memset(visited, 0, MAX_N);
    bfs(s);
    afisare(n);
    return 0;
}