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

using namespace std;

#define nmax 100005

vector <int> vecini[nmax];
vector <int> viz;
vector <int> dist;
queue <int > q;

void bfs(int s){
    q.push(s);
    viz[s] = 1;
    dist[s] = 0;
    while(!q.empty()){
        int nod = q.front();
        q.pop();
        int lim = vecini[nod].size();
        for(int i=0;i < lim;++i){
            int vecin = vecini[nod][i];
            if(viz[ vecin ] == 0){
                q.push(vecin);
                viz[vecin]=1;
                dist[vecin] = dist[nod]+1;
            }
        }
    }
}





int main()
{
    int n,m,s,x,y;
    ifstream f("bfs.in");
    ofstream g("bfs.out");
    f>>n>>m>>s;

    for(int i=0;i<=n;i++){
        viz.push_back(0);
        dist.push_back(-1);
    }


    for(int i=0;i<m;i++){
        f>>x>>y;
        vecini[x].push_back(y);
    }
    bfs(s);

    for(int i=1;i<=n;i++)
        g<<dist[i]<<" ";


    return 0;
}