#include <bits/stdc++.h>
using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

const int MAX = 1e5 + 5;

int n, m, s;
int visited[MAX];
vector<int> G[MAX];
queue<int> q;

void BFS()
{
    int u;

    q.push(s);
    visited[s] = 0;
    while(!q.empty())
    {
        u = q.front();
        q.pop();

        for(auto v : G[u])
            if(visited[v] == -1)
            {
                visited[v] = visited[u] + 1;
                q.push(v);
            }
    }
}

int main()
{
    int x, y;

    f >> n >> m >> s;
    for(int i = 1; i <= m; ++i)
    {
        f >> x >> y;
        G[x].push_back(y);
    }

    for(int i = 1; i <= n; ++i)
        visited[i] = -1;

    BFS();

    for(int i = 1; i <= n; ++i)
        g << visited[i] << " \n"[i == n];
    return 0;
}