#include <iostream>
#include <fstream>
#include <deque>
#include <vector>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int m, n, s, a, b, nr=1, c[100002];
deque<int>  q;
vector< vector<int> > lv;
vector<int>::iterator it;
void citire(){
f>>n>>m>>s;
lv.resize(n+1);
for(int i=0; i<m; ++i){
    f>>a>>b;
    lv[a].push_back(b);
    }
}

void bfs(int x){
q.push_back(x);
c[x]=0;
while(!q.empty()){
    a=q.front();
    q.pop_front();
    for(it=lv[a].begin(); it!=lv[a].end(); ++it)
    if(!c[*it]&&*it!=s){
        c[*it]=c[a]+1;
        q.push_back(*it);}
    }
}
int main()
{
    citire();
    bfs(s);
    c[s]=0;
    for(int i=1; i<=n; ++i){
    if(c[i]==0&&i!=s) g<<-1<<' ';
    else
        g<<c[i]<<' ';

    }
    g.close();
    return 0;
}