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

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

void bfs ()
{
    q.push(s);
    int x;
    while (!q.empty()){
        x=q.front();
        q.pop();
        for (int i=0; i<G[x].size(); i++){
            if (d[G[x][i]]>d[x]+1){
                d[G[x][i]]=d[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(d, 1, sizeof(d));
    d[s]=0;
    bfs();
    for (i=1; i<=n; i++){
        if (d[i]==d[0]) printf("-1 ");
        else printf("%d ", d[i]);
    }
    return 0;
}