#include <iostream>
#include <vector>
#include <map>
#include <cstring>
#include <fstream>
#include <sstream>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
#include <unordered_map>
#include <stack>
#include <iomanip>

using namespace std;

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

const int MAX = 100001;

int main() {
    int nodes, n, startNode;
    fin >> nodes >> n >> startNode;

    vector<vector<int>> ans(nodes + 1);
    for (int i = 0; i < n; ++i) {
        int x, y;
        fin >> x >> y;
        ans[x].push_back(y);
    }
    int dist[MAX];
    for (int i = 0; i <= nodes; ++i) {
        dist[i] = -1;
    }

    queue<int> q;
    q.push(startNode);
    dist[startNode] = 0;
    while (!q.empty()) {
        int curr = q.front();
        q.pop();
        for (auto i: ans[curr]) {
            if (dist[i] == -1) {
                dist[i] = dist[curr] + 1;
                q.push(i);
            }
        }
    }

    for (int i = 1; i <= nodes; ++i) {
        fout << dist[i] << " ";
    }

    return 0;
}