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

using namespace std;

int n, m, s;

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

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

    vector<vector<int>> arcs(n+1);
    vector<int> dist(n+1, -1);
    for(i=1; i<=m; ++i)
    {
        scanf("%d%d", &x, &y);
        arcs[x].push_back(y);
    }

    queue<int> que;
    que.push(s);
    dist[s] = 0;

    while(!que.empty())
    {
        x = que.front();
        que.pop();
        for(i=0; i<arcs[x].size(); ++i)
            if(dist[arcs[x][i]] == -1)
            {
                dist[arcs[x][i]] = dist[x] + 1;
                que.push(arcs[x][i]);
            }
    }

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

    fclose(stdin);
    fclose(stdout);

    return 0;
}