#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <queue>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
int n,m,s,x,y,G, viz[100001];
vector <int> v[100001];
queue <int> Q;
int main()
{
    in>>n>>m>>s;
    for(int i=1;i<=m;i++){
        in>>x>>y;
        v[x].push_back(y);
    }
    memset(viz,-1,sizeof(viz));
    viz[s]=0;
    Q.push(s);
    while(!Q.empty()){
        G=Q.front();
        Q.pop();
        for(int i=0;i<v[G].size();i++){
            if(viz[v[G][i]]==-1){
                viz[v[G][i]] = viz[G]+1;
                Q.push(v[G][i]);
            }
        }
    }
    for(int i=1;i<=n;i++)
        out<<viz[i]<<' ';
    return 0;
}