#include<bits/stdc++.h>
using namespace std;

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

vector<int> L[100001];
int vis[100001];
int d[100001];

void bfs(int sursa){
    for(int i = 1; i <= n; i++){
        d[i] = -1; //d[i] = distanta minima de la sursa la i
    }
    d[sursa] = 0;
    queue<int> q;
    q.push(sursa);
    while(q.empty() == false){
        int node = q.front();
        q.pop();
        for(auto vec : L[node]){
            if(d[vec] == -1){
                d[vec] = d[node] + 1;
                q.push(vec);
            }
        }
    }
}

int main(){
    int n, m, s;
    in >> n >> m >> s; // n noduri, m muchii 
    for(int i = 1; i <= m; i++){
        int a, b;
        in >> a >> b;
        L[a].push_back(b);
        //L[b].push_back(a);
    }
  bfs(s);
  for(int i = 1; i <= n; i++)
  out << d[i] << " ";
}