#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n, m, start;

void bfs(int v, vector<int>&visited, vector<vector<int>>&adj)
{
    queue<int>q;
    q.push(v);
    visited[v] = 0;
    while(!q.empty())
    {
        int f = q.front();
        q.pop();
        for(auto a : adj[f])
        {
            if(visited[a] == -1)
            {
                q.push(a);
                visited[a] = visited[f] + 1;
            }
        }
    }
}
int main()
{
    fin >> n >> m >> start;

    vector<int>visited(n + 1, -1);
    vector<vector<int>>adj(n + 1);

    for(int i = 0; i < m; i++)
    {
        int x, y;
        fin >> x >> y;
        adj[x].push_back(y);
    }

    bfs(start, visited, adj);

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