#include <fstream>
#include <iostream>
#include <climits>
#include <vector>
#include <queue>
#define NMax 100005
#define oo INT_MAX

using namespace std;

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

int n, m, s, viz[NMax],  d[NMax];
vector < pair <int, int> > G[NMax];
queue <int> coada;

void read(){
    fin >> n >> m >> s;
    for(int i = 1; i <= m; ++i){
        int x, y;
        fin >> x >> y;
        G[x].push_back(make_pair(y, 1));
    }
}

void print(){
    for(int i = 1; i <= n; ++i)
        if(d[i] == oo)
            fout << "-1 ";
        else
            fout << d[i] << " ";
}

void shortest_path(){
    for(int i = 1; i <= n; ++i)
        d[i] = oo;
    d[s] = 0;
    viz[s] = 1;
    coada.push(s);
    while(!coada.empty()){
        int curent = coada.front();
        viz[curent] = 0;
        coada.pop();
        for(int i = 0; i < G[curent].size(); ++i){
            int vecin = G[curent][i].first;
            int cost = G[curent][i].second;
            if(d[vecin] > d[curent] + cost){
                d[vecin] = d[curent] + cost;
                if(!viz[vecin]){
                    coada.push(vecin);
                    viz[vecin] = 1;
                }
            }
        }
    }
    print();

}

int main(){

    read();
    shortest_path();
//    fin.close();
//    fout.close();
    return 0;
}