#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

vector <int> G[100005];
queue <int> Q;

bool vizitat[100005];
int  n, x, m, y, nodStart, cost[100005];

void bfs(int nod)
{
    Q.push(nodStart);
    vizitat[nodStart] = true;
    while (!Q.empty())
    {
        int curr = Q.front();
        Q.pop();
        for (unsigned int i = 0; i < G[curr].size(); i++)
        {
            if (!vizitat[G[curr][i]])
            {
                vizitat[G[curr][i]] = true;
                cost[G[curr][i]] = cost[curr] + 1;
                Q.push(G[curr][i]);
            }
        }
    }
}

int main()
{
    fin >> n >> m >> nodStart;
    for (int i = 1; i <= m; i++)
    {
        fin >> x >> y;
        G[x].push_back(y);
    }
    for (int i = 1; i <= n; i++)
    {
        cost[i] = -1;
    }
    cost[nodStart] = 0;
    bfs(nodStart);
    for (int i = 1; i <= n; i++)
    {
        fout << cost[i] << " ";
    }
    return 0;
}