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

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

int n, m, s, x, y, i, d[100001];
vector<vector<int>> v (100001);
bool used[100001];

int main(){
    fin >> n >> m >> s;
    for(i = 1; i <= m; i++){
        fin >> x >> y;
        v[x].push_back(y);
    }

    used[s] = 1;
    queue<int> q;
    q.push(s);

    while(!q.empty()){
        s = q.front();
        q.pop();
        for(i = 0; i < v[s].size(); i++){
            if(!used[v[s][i]]){
                used[v[s][i]] = 1;
                q.push(v[s][i]);
                d[v[s][i]] = d[s] + 1;
            }
        }
    }

    for(i = 1; i <= n; i++){
        if(used[i])
            fout << d[i] << ' ';
        else
            fout << -1 << ' ';
    }
}