#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
const int NMAX = 100001;
vector<int> adj[NMAX]; /// adj[i] - multimea elementelor adiacente lui i
int dist[NMAX];

void bfs(int sursa)
{
    queue<int> Q;
    Q.push(sursa);
    while (!Q.empty())
    {
        int nodCrt = Q.front();
        Q.pop();
        for (auto vec: adj[nodCrt])
        {
            if (dist[vec] == 0)
            {
                dist[vec] = dist[nodCrt] + 1;
                Q.push(vec);
            }
        }
    }
}

int main()
{
    int n, m, sursa;
    f >> n >> m >> sursa;
    for (int i = 1; i <= m; i++)
    {
        int x, y;
        f >> x >> y;
        adj[x].push_back(y); /// din x se poate ajunge in y
    }
    dist[sursa] = 1;
    bfs(sursa);
    for (int i = 1; i <= n; i++)
    {
        g << dist[i] - 1<<' ';
    }
    return 0;
}