#include <fstream>
#include <vector>
using namespace std;
ifstream f("BFS.in");
ofstream g("BFS.out");
vector<int> graph[1001];
int n, m, queue[1001], visited[1001], starting_node, i, node1, node2, first, last;
int main()
{
    f>>n>>m>>starting_node;
    for (i=1; i<=m; i++) {
        f>>node1>>node2;
        graph[node1].push_back(node2);
    }
    first=1;
    last=1;
    queue[first]=starting_node;
    visited[starting_node]=1;
    while (first <= last) {
        for (i=0; i<graph[queue[first]].size(); i++) {
            if (visited[graph[queue[first]][i]]==0) {
                last++;
                queue[last]=graph[queue[first]][i];
                visited[queue[last]] = visited[queue[first]] + 1;
            }
        }
        first++;
    }
    for (i=1; i<=n; i++) {
        if (visited[i]!=0)
            g<<visited[i]-1<<" ";
        else
            g<<-1<<" ";
    }
    return 0;
}