#include <cstdio>
#include <vector>
#define N_MAX 100002
#define NO_MUCHIE -1
using namespace std;

int n, m;
int START;
vector<int> lists[N_MAX];
int q[N_MAX];
int p = 1;
int u = 0;

bool viz[N_MAX];
int muc[N_MAX];

inline void citire();
inline void BFS();

int main()
{
    citire();
    for (int i = 1; i <= n; ++i) muc[i] = NO_MUCHIE;
    BFS();

    for (int i = 1; i <= n; ++i) {
        printf("%d ", muc[i]);
    }
    printf("\n");
    return 0;
}

inline void citire () {
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);

    scanf("%d%d%d", &n, &m, &START);

    int x, y;

    for (int i = 1; i <= m; ++i) {
        scanf("%d%d", &x, &y);
        lists[x].push_back(y);
    }
}

inline void BFS () {
    q[++u] = START;
    muc[START] = 0;
    viz[START] = true;

    while (p <= u) {
        int nod = q[p];
        int v_size = lists[nod].size();

        for (int i = 0; i < v_size; ++i) {
            if (!viz[lists[nod][i]]){
                viz[lists[nod][i]] = true;
                muc[lists[nod][i]] = muc[nod] + 1;
                q[++u] = lists[nod][i];
            }
        }
        p++;
    }
}