#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>
#include <deque>
#define dim 100005
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector <int> L[dim];
//bool fr[dim];
bitset<dim> fr;
int n,m,x,y,s;
int d[dim];
void bfs(int start){
    fr[start]=1;

    deque<int> q; /// coada pentru nodurile care urmeaza sa fie vizitate
    q.push_back(start); /// introduc in coada nodul de start
    while(!q.empty()){
        int nod=q.front();
        q.pop_front();
        /// pentru nod vom lua toti vecinii si adaugam in coada + schimbare distanta si frecventa
        for(auto vecin:L[nod]){
            if(fr[vecin]==0){
                fr[vecin]=1;
                d[vecin]=d[nod]+1;
                q.push_back(vecin);
            }
        }
    }
}
int main() {
    fin>>n>>m>>s;
    for(int i=1;i<=m;i++){
        fin>>x>>y;
        L[x].push_back(y);
    }
    bfs(s);
    for(int i=1;i<=n;i++){
        if(fr[i]==0){
            fout<<-1<<" ";
        }
        else fout<<d[i]<<" ";
    }
}