#include <bits/stdc++.h>
#include <queue>
#include <vector>
#include <fstream>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int inf = 1e9;
vector <int> L[100001];
int vis[100001];
int d[100001];
queue<int> q;

void dfs(int x) {
    vis[x] = 1;

    for (int v : L[x]) {
        if (vis[v] == 0) {
            dfs(v);
        }
    }
}

void bfs(int s, int n) {
    for (int i = 1; i <= n; i++) {
        d[i] = inf;
    }

    d[s] = 0;
    q.push(s);

    int nod;

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

        for (int v : L[nod]) {
            if (d[v] > d[nod] + 1) {
                d[v] = d[nod] + 1;
                q.push(v);
            }
        }
    }
}
int main()
{
    int n, m, cnt = 0, s;
    fin >> n >> m >> s;
    int x, y;

    while (fin >> x >> y) {
        L[x].push_back(y);
    }
    //  for(int i=1;i<=n;i++){
    //     if(vis[i]==0){
    //         cnt++;
    //         dfs(i);
    //     }
    //  }

    bfs(s, n);

    for (int i = 1; i <= n; i++) {
        if (d[i] == inf) {
            fout << "-1 ";
        }
        else {
            fout << d[i] << ' ';
        }
    }
    return 0;
}