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

const int INF = 2 << 30;

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

vector<vector<int>> adj;
vector<bool> vis;
vector<int> dist;

void bfs(int n) {
    queue<int> q;
    dist[n] = 0;
    q.push(n);

    while (!q.empty())
    {
        int curr = q.front();
        q.pop();

        for (int v : adj[curr]) {
            if (dist[v] == -1) {
                dist[v] = dist[curr] + 1;
                q.push(v);
            }
        }
    }


}

int main() {
    int n, m, k;
    cin >> n >> m >> k;

    adj.assign(n + 1, vector<int>());
    dist.assign(n + 1, -1);

    for (int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
    }

    bfs(k);

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

}