#include <bits/stdc++.h>

using namespace std;

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

vector<vector <int>> v;
queue<int> q;

int dist[100001];
int n, m, s;
int x, y;

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

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

    for(int i = 1; i <= n; i ++){
        out << dist[i] - 1 << " ";
    }
    return 0;
}