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

using namespace std;

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

int f[10001];
int n;
vector<int> a[100001];
int cost[100001];

void bfs(int firstNode) {
    queue<int> q;

    f[firstNode] = 1;
    q.push(firstNode);

    while (!q.empty()) {
        int currentNode = q.front();
        q.pop();

        for (auto Node:a[currentNode]) {
            if (!f[Node]) {
                cost[Node] = cost[currentNode] + 1;
                f[Node] = 1;
                q.push(Node);
            }
        }
    }
}

int main() {
    int m, x, y, s;
    fin>>n>>m>>s;

    for (int i = 1; i <= m; i++) {
        fin>>x>>y;

        a[x].push_back(y);
    }

    bfs(s);
    for (int i = 1; i <= n; i++) {
        if (i != s && cost[i] == 0) fout<<-1<<" ";
        else fout<<cost[i]<<" ";
    }
    return 0;
}