#include <bits/stdc++.h>
#define NMax 100005

using namespace std;

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

vector <int>v[NMax];
int n,m,comp,s,sol[NMax],nod,sz;
bool viz[NMax];
deque <int>p;

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

void rezolvare(){
    citire();
    p.push_back(s);
    viz[s]=1;
    while(p.empty()== false){
        nod=p[0];
        sz=v[nod].size();
        for(int i=0;i<sz;i++){
        if(viz[v[nod][i]]==0){
            p.push_back(v[nod][i]);
            sol[v[nod][i]]=sol[nod]+1;
            viz[v[nod][i]]=1;
            }
        }
        p.pop_front();
    }
    for(int i=1;i<=n;i++)
        if(sol[i]==0 and i!=s)
        fout<<-1<<" ";
        else fout<<sol[i]<<" ";
}

int main()
{
    rezolvare();
    return 0;
}