#include <fstream>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector<int> graph[100001];
int cost[100001];
void bfs(int s)
{
    queue<int> q;
    q.push(s);
    cost[s] = 1;
    while (!q.empty())
    {
        int x = q.front();
        q.pop();
        for (auto i : graph[x])
        {
            cout << i;
            if (cost[i] == 0)
            {
                cost[i] = cost[x] + 1;
                q.push(i);
            }
        }
    }
}
int main()
{
    int n, m, s;
    fin >> n >> m >> s;
    while (m--)
    {
        int x, y;
        fin >> x >> y;
        graph[x].push_back(y);
    }

    bfs(s);
    for (int i = 1; i <= n; i++)
    {
        fout << cost[i] - 1 << " ";
    }
    return 0;
}