# include <cstdio>
# include <cstring>
# include <queue>
# include <vector>
using namespace std;

const char *FIN = "bfs.in", *FOU = "bfs.out";
const int MAX = 100005;

vector <int> G[MAX];
int N, M, S, dp[MAX];

void bfs (int S) {

    queue <int> Q;
    for (Q.push (S); !Q.empty (); Q.pop ()) {
        int X = Q.front ();
        for (vector <int> :: iterator i = G[X].begin (); i != G[X].end (); ++i)
            if (dp[*i] == -1) {
                Q.push (*i), dp[*i] = dp[X] + 1;
            }
    }
}
void dfs (int S) {
    for (vector <int> :: iterator it = G[S].begin (); it != G[S].end (); ++it)
        if (dp[*it] == -1)
            dp[*it] = dp[S] + 1, dfs (*it);
}

int main (void) {
    freopen (FIN, "r", stdin);
    freopen (FOU, "w", stdout);

    scanf ("%d %d %d", &N, &M, &S);
    for (int i = 1, x, y; i <= M; ++i) {
        scanf ("%d %d", &x, &y);
        G[x].push_back (y);
    }
    memset (dp, -1, sizeof (dp)), dp[S] = 0;
    dfs (S);
    for (int i = 1; i <= N; ++i)
        printf ("%d ", dp[i]);
}