#include <bits/stdc++.h>
using namespace std;

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

vector<int> g[100005];
int n, m, s;
int dist[100005];


void citire() {
    fin >> n >> m >> s;
    for(int i = 1; i <= m; i++) {
        int a, b;
        fin >> a >> b;
        g[a].push_back(b);
    }
}

void solve() {
    memset(dist, -1, sizeof dist);
    dist[s] = 0;
    queue<int> q;
    q.push(s);
    while(!q.empty()) {
        int curr = q.front();
        q.pop();
        for(int i = 0; i < g[curr].size(); i++)
            if(dist[g[curr][i]] == -1) {
                dist[g[curr][i]] = dist[curr]+1;
                q.push(g[curr][i]);
            }
    }
}

void afis() {
    for(int i = 1; i <= n; i++)
        fout << dist[i] << ' ';
}

int main() {
    citire();
    solve();
    afis();
}