#include <fstream>
#include <queue>
#include <map>
#include <vector>
#include <iterator>
using namespace std;

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

typedef map<int, vector<int> > graf;

inline void bfs(graf g, int n, int i) {
    int t;
    queue<int> Q;
    vector<int> cost(n + 1, -1);
    vector<int>::iterator it;
    Q.push(i);
    cost[i] = 0;

    while (!Q.empty()) {
        t = Q.front();
        Q.pop();
        vector<int>::iterator endit = g[t].end();
        for (it = g[t].begin(); it != endit; ++it) {
            int itv = *it;
            if (cost[itv] == -1) {
                Q.push(itv);
                cost[itv] = cost[t] + 1;
            }
        }
    }

    t = cost.size();
    for (i = 1; i < t; i++) {
        out << cost[i] << ' ';
    }
}

int main()
{
    int n, m, s, i, x, y;
    graf g;

    in >> n >> m >> s;
    for (i = 0; i < m; i++) {
        in >> x >> y;
        g[x].push_back(y);
    }

    bfs(g, n, s);

    in.close();
    out.close();

    return 0;
}