#include <bits/stdc++.h>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");

const int N_MAX = 500;
vector<int> v[N_MAX];
int dist[N_MAX + 1];

void bfs(int start, int n) {
    dist[start] = 1;
    queue<int> q;
    q.push(start);
    while (!q.empty()) {
        int x = q.front();
        q.pop();
        for (int i = 0; i < v[x].size(); ++i) {
            if (!dist[v[x][i]]) {
                dist[v[x][i]] = dist[x] + 1;
                q.push(v[x][i]);
            }
        }
    }
    for (int i = 1; i <= n; ++i) {
        fout << dist[i] - 1 << ' ';
    }
}

int main() {
    fin.tie(0);
    std::ios_base::sync_with_stdio(0);
    int n, m, s;
    fin >> n >> m >> s;
    for (int i = 0; i < m; ++i) {
        int x, y;
        fin >> x >> y;
        v[x].push_back(y);
    }
    bfs(s, n);
}