#include <iostream>
#include <fstream>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
struct node {
    int value;
    node * next;
};
node *v[100001];
void add(node* &head, int val) {
    node* el = new node;
    el -> value = val;
    el -> next = head;
    head = el;
}
node* nodes[100001];
int nrNodes = 1;
int coada[100001];
void BFS(node* &head, int distance[100001],int visited[100001], int j) {

    while (head != NULL) {
        int nr = head -> value;
        if(visited[nr] == 0) {
            visited[nr] = 1;
            distance[nr] = distance[coada[j]] + 1;
            ++nrNodes;
            coada[nrNodes] = nr;
        }
        head = head -> next;
    }
}
int main()
{
    int n, m, distance[100001], visited[100001], S;
    //initializare
    f >> n >> m >> S;
    for(int i = 1; i <= n; i++) {
        v[i] = NULL;
        distance[i] = -1;
        visited[i] = 0;
    }

    while(m--) {
        int x, y;
        f >> x >> y;
        add(v[x], y);
    }
    distance[S] = 0; visited[S] = 1; coada[1] = S;
    for(int j = 1; j <= nrNodes; j++)
        BFS(v[coada[j]], distance, visited, j);
    for(int i = 1; i <= n; i++)
        g << distance[i] << " ";
    return 0;
}