#include "bits/stdc++.h"
#define NMAX 100005

using namespace std;

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

int n, m, s, a, b, l;
vector<int> adj[NMAX];
vector<int> drum(NMAX, 0);
vector<bool> vis(NMAX, false);

void bfs(int start) {
    queue<int> q;
    q.push(start);
    vis[start] = true;

    while (!q.empty()) {
        int node = q.front();
        q.pop();
        vis[node] = true;

        for (int i = 0; i < adj[node].size(); i++) {
            int next = adj[node][i];
            if (!vis[next]) {
                l++;
                q.push(next);
                drum[next] = drum[node] + 1;
                vis[next] = true;
            }
        }
    }
}

int main() {
    fin >> n >> m >> s;

    while (m--) {
        fin >> a >> b;
        adj[a].push_back(b);
    }

    drum[s] = 1;
    bfs(s);
    
    for (int i = 1; i <= n; i++) {
        fout << drum[i] - 1 << ' ';
    }

    return 0;
}