#include <stdio.h>
#include <vector>
#include <queue>

#define N 100001

using namespace std;

vector <int> Nod[N];
int n, m, s, cost[N];

void BFS()
{
    int i, nodc;
    queue <int> Q;
    memset(cost, -1, sizeof(cost));

    Q.push(s);
    cost[s] = 0;

    while(!Q.empty())
    {
        nodc = Q.front();
        Q.pop();
        for(i = 0; i < Nod[nodc].size(); i++)
            if(cost[Nod[nodc][i]] < 0)
            {
                cost[Nod[nodc][i]] = cost[nodc] + 1;
                Q.push(Nod[nodc][i]);
            }
    }
}

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

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

    int x, y, i;

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

    BFS();

    for(i = 1; i <= n; i++)
        printf("%d ", cost[i]);
    printf("\n");

    return 0;
}