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

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

const int MAXN = 100005;
int n, m, s;
vector<int> v[MAXN];
int d[MAXN];

int main() {

    fin >> n >> m >> s;
    for (int i = 1; i <= m; ++i) {
        int a, b;
        fin >> a >> b;
        v[a].push_back(b);
    }

    for (int i = 1; i <= n; ++i) {
        d[i] = -1;
    }

    queue<int> q;
    q.push(s);
    d[s] = 0;
    while (!q.empty()) {
        int node = q.front();
        for (int i = 0; i < v[node].size(); ++i) {
            int k = v[node][i];
            if (d[k] == -1) {
                d[k] = d[node] + 1;
                q.push(k);
            }
        }
        q.pop();
    }

    for (int i = 1; i <= n; ++i) {
        fout << d[i] << ' ';
    }

    fout.close();
    return 0;
}