#include <iostream>
#include <fstream>
#include <list>
#include <queue>

using namespace std;

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

list<int> nod[100005];
int mi[100005];
queue<int> qu;

int main() {

    int n,m,s,x,y;
    in >> n >> m >> s;

    for(int i = 1; i <= m; i++) {
        in >> x >> y;
        nod[x].push_back(y);
    }

    qu.push(s);
    int nodT;
    list<int>::iterator it;
    mi[s] = 1;

    while(!qu.empty()) {
        nodT = qu.front();
        qu.pop();
        for(it = nod[nodT].begin(); it != nod[nodT].end(); it++) {
            if(mi[*it] == 0) {
                mi[*it] = mi[nodT]+1;
                qu.push(*it);
            }
        }
    }

    for(int i = 1; i <= n; i++)
        out << mi[i]-1 << " ";

    return 0;
}