#include <fstream>
#include <vector>
#include <queue>
#include <bitset>

using namespace std;

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

int n, m, s;
vector<vector<int>> graf;
vector<int> ans;
queue<int> q;
bitset<100001> viz;

void bfs() {
    viz[s] = 1;
    ans[s] = 0;
    q.push(s);
    while (!q.empty()) {
        int current = q.front();
        q.pop();
        for (int neighbor : graf[current]) {
            if (!viz[neighbor]) {
                viz[neighbor] = 1;
                ans[neighbor] = ans[current] + 1;
                q.push(neighbor);
            }
        }
    }
}

int main() {
    cin >> n >> m >> s;
    graf.resize(n + 2);
    for (int i = 1 ; i <= m ; ++i) {
        int src, dest;
        cin >> src >> dest;
        graf[src].push_back(dest);
    }
    ans.assign(n + 2, -1);
    bfs();
    for (int i = 1 ; i <= n ; ++i) {
        cout << ans[i] << " ";
    }
    return 0;
}