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

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

vector <int> edges[100001];
queue <int> q;

int N, M, S, dist[100001];

void BFS() {
    int nod, neighbour;
    q.push(S);
    while(q.empty() == 0) {
        nod = q.front();
        q.pop();
        for(size_t i = 0; i < edges[nod].size(); i++) {
            neighbour = edges[nod][i];
            if(dist[neighbour] == -1) {
                q.push(neighbour);
                dist[neighbour] = dist[nod] + 1;
            }
        }
    }
}

void Read() {
    fin>>N>>M>>S;
    for(int i = 1; i <= M; i++) {
        int x, y;
        fin>>x>>y;
        edges[x].push_back(y);
    }
    for(int i = 1; i <= N; i++)
        dist[i] = -1;
    dist[S] = 0;
}

void showDist() {
    for(int i = 0; i < N; i++)
        fout<<dist[i]<<" ";
}

int main() {
    Read();
    BFS();
    showDist();
    return 0;
}