#include <iostream>
#include <fstream>
#include <vector>
#include <deque>
#define MAX 1000002
using namespace std;
int n,m,x,y,s,f[MAX],dist[MAX];
vector<int> v[MAX];
/// v[x] = vecinii nodului x
deque<int> dq;

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

int main()
{
    fin >> n >> m >> s;
    for(int i = 1; i <= m; i++){
        fin >> x >> y;
        v[x].push_back(y);
    }
    dq.push_back(s);
    f[s] = 1;
    dist[s] = 0;
    while(!dq.empty()){
        int nod = dq.front();
        dq.pop_front();
        for(int i = 0; i < v[nod].size(); i++){
            int vecin = v[nod][i];
            if(f[vecin] == 0){
                f[vecin] = 1;
                dist[vecin] = dist[nod]+1;
                dq.push_back(vecin);
            }
        }
    }
    for(int i = 1; i <= n; i++){
        if(f[i] == 0){
            fout << "-1 ";
        }else{
            fout << dist[i] << " ";
        }
    }
    return 0;
}