#include <bits/stdc++.h>

using namespace std;
ifstream fin ("bfs.in");
ofstream fout ("bfs.out");
int n, m, s, x, y, nod;
vector <int> v[1000005];
bool viz[100005];
int d[100005];
queue <int> q;

int main()
{
    fin >> n >> m >> s;
    for(int i = 1; i <= m; i++){
        fin >> x >> y;
        v[x].push_back(y);
    }
    q.push(s);
    viz[s] = 1;
    while(!q.empty()){
        nod = q.front();
        //cout << nod << " ";
        for(int i = 0; i < v[nod].size(); i++){
            if(viz[v[nod][i]] == 0){
                q.push(v[nod][i]);
                viz[v[nod][i]] = 1;
                d[v[nod][i]] = d[nod] + 1;
            }
        }
        q.pop();
    }
    for(int i = 1; i <= n; i++){
        if(viz[i] == 0){
            fout << -1 << " ";
        }
        else{
            fout << d[i] << " ";
        }
    }
    return 0;
}