#include <iostream>
#include <fstream>
#include <queue>
#include <vector>

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,x,y,s;
const int nlim=100001;
vector <int> a[nlim];
int dist[nlim];
queue <int> c;

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

}
void bfs(){
int nod, vecin;
while(!c.empty()){
    nod=c.front();
    c.pop();
    for(unsigned int i=0;i<a[nod].size();i++){
        vecin=a[nod][i];
        if(dist[a[nod][i]]==-1){
            c.push(vecin);
            dist[vecin]=dist[nod]+1;
        }
    }
}

}

int main()
{
 citire();
for(int i=1;i<=n;i++){
    dist[i]=-1;
}
dist[s]=0;
c.push(s);
bfs();
for(int i=1;i<=n;i++)
    g<<dist[i]<<" ";
}