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

int v[100001];
vector <int> mat[100001];

void addComp (int x, int nr)
{
    v[x] = nr;
    int i, n = mat[x].size();
    for (i = 0; i < n; ++i)
    {
        if (!v[mat[x][i]])
        {
            addComp (mat[x][i], nr);
        }
    }
}

int main()
{
    freopen ("bfs.in", "r", stdin);
    freopen ("bfs.out", "w", stdout);
    int n, m, s, i, x, y, nr = 0, j;
    scanf ("%d%d%d", &n, &m, &s);
    for (i = 0; i < m; ++i)
    {
        scanf ("%d%d", &x, &y);
        mat[x].push_back(y);
    }

    for (i = 1; i <= n; ++i)
    {
        v[i] = -1;
    }

    queue <int> q;
    v[s] = 0;
    q.push(s);
    while (!q.empty())
    {
        x = q.front();
        q.pop();
        for (j = 0; j < mat[x].size(); ++j)
        {
            if(v[mat[x][j]] == -1)
            {
                v[mat[x][j]] = v[x]+1;
                q.push(mat[x][j]);
            }
        }
    }

    for (i = 1; i <= n; ++i)
    {
        printf ("%d ", v[i]);
    }

    return 0;
}