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

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

vector<vector<int>> v(100001);

vector<int> bfs(int s) {
    vector<int> d(100001, -1);
    queue<int> Q;
    d[s] = 0;
    Q.push(s);
    int nod;
    while (!Q.empty()) {
        nod = Q.front();
        Q.pop();
        for (auto vecin : v[nod]) {
            if (d[vecin] == -1) {
                d[vecin] = d[nod] + 1;
                Q.push(vecin);
            }
        }
    }
    return d;
}

int main() {
    int n, m, s, x, y;
    in >> n >> m >> s;
    for(int i = 0; i < m; i++) {
        in >> x >> y;
        v[x].push_back(y);
    }
    vector<int> sol = bfs(s);
    for(int i = 1; i <= n; i++)
    {
        out << sol[i] << " ";
    }
    
    
    return 0;
}