#include <iostream>
#include <fstream>
#include <stdio.h>
#include <queue>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <stack>

#if 1
#define pv(x) cout<<#x<<" = "<<x<<"; ";cout.flush()
#define pn cout<<endl
#else
#define pv(x)
#define pn
#endif

using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");

#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
const int NMax = 1e5 + 5;
const int inf = 1e9 + 5;
const int mod = 9973;

int N,M,S;
int dist[NMax];
vector<int> v[NMax];

int main() {
    in>>N>>M>>S;
    for (int i=1;i <= M;++i) {
        int x,y;
        in>>x>>y;

        v[x].pb(y);
    }

    for (int i=1;i <= N;++i) {
        dist[i] = inf;
    }

    queue<int> Q;
    Q.push(S);
    dist[S] = 0;
    while (Q.size()) {
        int node = Q.front(); Q.pop();

        for (int nxt : v[node]) {
            if (dist[nxt] != inf) {
                continue;
            }

            dist[nxt] = dist[node] + 1;
            Q.push(nxt);
        }
    }

    for (int i=1;i <= N;++i) {
        out<<( (dist[i] == inf) ? -1 : dist[i] )<<' ';
    }

    return 0;
}