#include <fstream>
#include <vector>
#include <queue>

constexpr int kMaxN = 100000;
constexpr int kUnreachable = -1;

int n, m, s;
int distance[kMaxN+1];
std::vector<int> edges[kMaxN+1];

int main()
{
    std::ifstream in("bfs.in");
    std::ofstream out("bfs.out");
    std::queue<int> Q;

    in>>n>>m>>s;
    for(int i = 1; i <= n; ++i) distance[i] = kUnreachable;
    for(int x, y, i = 1; i <= m; ++i) {
        in>>x>>y;
        edges[x].push_back(y);
    }
    distance[s] = 0;
    Q.push(s);
    while(!Q.empty()) {
        int d = distance[Q.front()]+1;
        for(int x : edges[Q.front()]) {
            if(distance[x] == kUnreachable) {
                distance[x] = d;
                Q.push(x);
            }
        }
        Q.pop();
    }
    for(int i = 1; i <= n; ++i) out<<distance[i]<<' ';
    return 0;
}