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

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

int N, M, S;
int Distance[100005];
vector <int> Edge[100005];
queue <int> Q;

void BFS() {
    int Node, Next;
    while(!Q.empty()) {
        Node = Q.front();
        Q.pop();
        for (int i = 0; i < Edge[Node].size(); ++i) {
            Next = Edge[Node][i];
            if (Distance[Next] == -1) {
                Q.push(Next);
                Distance[Next] = Distance[Node] + 1;
            }
        }
    }
}

void Read() {
    cin >> N >> M >> S;
    for (int i = 1; i <= M; ++i) {
        int x, y;
        cin >> x >> y;
        Edge[x].push_back(y);
    }
}

int main() {
    Read();

    for (int i = 1; i <= N; ++i)
        Distance[i] = -1;

    Distance[S] = 0;
    Q.push(S);
    BFS();
    for (int i = 1; i <= N; ++i)
        cout << Distance[i] << ' ';

    return 0;
}