#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>

using namespace std;

int n, m, s, i,x, y, dist[100002];
vector<int>G[100102];
queue<int>q;

void bfs()
{
    q.push(s);
    dist[s]=0;
    while (!q.empty()){
        x=q.front();
        q.pop();
        for (i=0; i<G[x].size(); i++){
            if (dist[G[x][i]]>dist[x]+1){
                dist[G[x][i]]=dist[x]+1;
                q.push(G[x][i]);
            }
        }
    }
}

int main ()
{
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);

    scanf("%d%d%d", &n, &m, &s);
    for (i=1; i<=m; i++){
        scanf("%d%d", &x, &y);
        G[x].push_back(y);
    }
    memset(dist, 1, sizeof(dist));

    bfs();
    for (i=1; i<=n; i++){
        if (dist[i]>n) printf("-1 ");
        else printf("%d ", dist[i]);
    }
    return 0;
}