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

ifstream in("bfs.in");
ofstream out("bfs.out");
vector<int> a[1000];
int v[1000],s;
queue<int> coada;
void parcurgere()
{
    int d;
    while(!coada.empty()){
        d = coada.front();
        coada.pop();
        for(auto b:a[d]){
            if(v[b] == -1){
                coada.push(b);
                v[b] = v[d] + 1;
            }
        }
    }
}

int main()
{
   int i,j,l,n,m,x,y;
   in>>n>>m>>s;
   for(i=1;i<=m;i++){
       in>>x>>y;
       a[x].push_back(y);
            }
    for(i=1;i<=n;i++){
        sort(a[i].begin(),a[i].end());
    }
    for(i=1;i<=n;i++)
        v[i]=-1;
    coada.push(s);
    v[s]=0;
    parcurgere();
    for(int i = 1; i <= n; i++)
        out << v[i] << ' ';

}