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

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

vector < int > G[100001];
queue < int > Q;
int cost[100001];

void BFS() {
    while(!Q.empty()) {
        int nod = Q.front();
        Q.pop();
        for(int i=0; i<G[nod].size(); i++) {
            int x = G[nod][i];
            if(cost[x] == -1) {
                cost[x] = cost[nod] + 1;
                Q.push(x);
            }
        }
    }
}

int main() {
    int n, m, s;
    int x, y;
    f >> n >> m >> s;
    for(int i=1; i<=m; i++) {
        f >> x >> y;
        G[x].push_back(y);
    }
    for(int i=1; i<=n; i++)
        cost[i] = -1;
    cost[s] = 0;
    Q.push(s);
    BFS();
    for(int i=1; i<=n; i++)
        g << cost[i] << " ";
}