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

ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n, m, s, x, y, curr_node, curr_cost;
queue<pair<int, int>> node;
vector<vector<int>> vertex;
vector<bool> vis;
vector<int> dist;
int main() {
    fin >> n >> m >> s;
    vertex.reserve(n+1);
    vis.reserve(n+1);
    dist.reserve(n+1);
    fill(dist.begin(), dist.begin()+n+1, -1);
    for(int i = 0; i < m; i++) {
        fin >> x >> y;
        vertex[x].push_back(y);
    }
    node.push(make_pair(s, 0));
    while(!node.empty()) {
        curr_node = node.front().first;
        curr_cost = node.front().second;
        node.pop();

        vis[curr_node] = 1;
        dist[curr_node] = curr_cost;
        for(unsigned int i = 0; i < vertex[curr_node].size(); i++) {
            if(!vis[vertex[curr_node][i]]) {
                node.push(make_pair(vertex[curr_node][i], curr_cost+1));
            }
        }
    }
    for(int i = 1; i <= n; i++) {
        fout << dist[i] << " ";
    }
    fin.close();
    fout.close();
    return 0;
}