#include <iostream>
#include <vector>
#include <fstream>
#include <queue>
#define NMAX 1000000
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");


vector <int> v[NMAX];
queue <int> q;

int n, m, s, x, y, var;
bool vld[100005];
int dist[100005];

void bfs(int nod){
    q.push(nod);
    dist[nod]=0;
    vld[nod]=1;
    while(!q.empty()){
        var=q.front();

        q.pop();
        for(auto i:v[var]){
            if(vld[i]!=1){
                q.push(i);
                vld[i]=1;
                dist[i]=dist[var]+1;
            }
        }
    }
}






int main(){


    in>>n>>m>>s;

    for(int i=1;i<=m;i++) {
      in>>x>>y;
      v[x].push_back(y);
      //v[y].push_back(x);
    }
    for(int i=1;i<=n;i++){
        dist[i]=-1;
    }
    bfs(s);
    for(int i=1;i<=n;i++){
        out<<dist[i]<<" ";
    }




}