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

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

vector<vector<int>> graf;
vector<int> dist;
queue<int> q;

void bfs(int start) {
    dist[start] = 0;
    q.push(start);
    while (!q.empty()) {
        int nod = q.front();
        q.pop();
        for (int i = 0; i < graf[nod].size(); i++) {
            int vecin = graf[nod][i];
            if (dist[vecin] > dist[nod] + 1) {
                dist[vecin] = dist[nod] + 1;
                q.push(vecin);
            }
        }
    }
}

int main() {
    int n, m, s;
    fin >> n >> m >> s;

    graf.resize(n + 1);
    dist.resize(n + 1, 1e9);

    for (int i = 0; i < m; i++) {
        int x, y;
        fin >> x >> y;
        graf[x].push_back(y);
    }

    bfs(s);

    for (int i = 1; i <= n; i++)
        if (dist[i] == 1e9)
            fout << -1 << " ";
        else
            fout << dist[i] << " ";

    return 0;
}