#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

const int oo = 2e9;
int n, m, startNode;
vector <vector <int> > v;
vector <int> d;
vector <bool> visited;
queue <int> q;

void init() {
    v = vector <vector <int> > (n + 1);
    visited = vector <bool> (n + 1);
    d = vector <int> (n + 1, oo);
}

void read() {
    f >> n >> m >> startNode;
    init();
    int x, y;
    for(int i = 1; i <= m; ++i) {
        f >> x >> y;
        v[x].push_back(y);
    }
}

void bfs() {
    q.push(startNode);
    d[startNode] = 0;
    visited[startNode] = true;
    int node;
    while(!q.empty()) {
        node = q.front();
        q.pop();
        for(const int& vecin : v[node]) {
            if((!visited[vecin]) && (d[node] + 1 < d[vecin])) {
                q.push(vecin);
                visited[vecin] = true;
                d[vecin] = d[node] + 1;
            }
        }
    }
}

int main()
{
    read();
    bfs();
    for(int i = 1; i <= n; ++i) {
        if(d[i] == oo)
            g << -1 << " ";
        else g << d[i] << " ";
    }
}