//
// Created by riges on 1/27/2025.
//
#include <bits/stdc++.h>
using namespace std;

void BFS(int x, vector<int>& viz, vector<int>& tata, vector<int>& d, vector<vector<int>>& c) {
    queue<int> coada;
    viz[x] = 1;
    tata[x] = -1;
    d[x] = 0;
    coada.push(x);
    while(!coada.empty()) {
        int curent = coada.front();
        coada.pop();
        for(int next : c[curent])
            if(!viz[next])
            {
                viz[next] = 1;
                tata[next] = curent;
                d[next] = d[curent] + 1;
                coada.push(next);
            }
    }
}

int main() {
    int n, m, s, u, v;
    cin >> n >> m >> s;
    vector<vector<int>> C(n+1);
    vector<int> d(n+1, -1);
    vector<int> viz(n+1, 0);
    vector<int> tata(n+1, -1);
    for(int j = 0; j < m ; j++)
    {
        cin >> u >> v;
        C[u].push_back(v);
    }
    BFS(s, viz, tata, d, C);
    for(int i = 1; i <= n ; i++)
        cout << d[i] << " ";
}