#include <bits/stdc++.h>

using namespace std;

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

vector<vector<int>> v;
vector<bool> viz;
vector<int> dist;

void bfs(int nod) {
    queue<int> q;
    q.emplace(nod);
    while(!q.empty()) {
        int now = q.front();
        q.pop();
        for(auto x : v[now]) {
            if(!viz[x]) {
                viz[x] = true;
                q.emplace(x);
                dist[x] = dist[now] + 1;
            }
        }
    }
}

int main() {
    int n, m, s; fin >> n >> m >> s;
    v.resize(n+5); viz.resize(n+5); dist.resize(n+1);
    for(int i = 1; i <= m; i++) {
        int x, y;
        fin >> x >> y;
        v[x].emplace_back(y);
    }
    for(int i = 1; i <= n; i++) {
        dist[i] = -1;
    }
    viz[s] = true;
    dist[s] = 0;
    bfs(s);
    for(int i = 1; i <= n; i++) {
        fout << dist[i] << " ";
    }
    return 0;
}