#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

#define maxim 10000

int coada[maxim], st = 1, dr = 1, costuri[maxim];
vector<int> a[maxim], vizitat;

int gasit(int x) {
    for(auto i: vizitat)
        if(i == x)
            return 1;
    return 0;
}

int main()
{
    int n, m, s;
    ifstream in("bfs.in");
    ofstream out("bfs.out");
    in >> n >> m >> s;
    for(int i = 1; i <= m; i++){
        int x, y;
        in >> x >> y;
        a[x].push_back(y);
    }

    coada[st] = s;
    vizitat.push_back(s);
    costuri[s] = 0;
    dr++;
    while(st != dr) {
        int k = coada[st];
        for(auto i = a[k].begin(); i <= a[k].end(); i++) {
            if(*i != 0 && gasit(*i) == 0){
                costuri[*i] += (costuri[k] + 1);
                vizitat.push_back(*i);
                coada[dr] = *i;
                dr++;
            }
        }
        st++;
    }
    for(int i = 1; i <= n; i++) {
        if(gasit(i) == 1)
            out << costuri[i] << " ";
        else out << - 1 << " ";
    }
    return 0;
}