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

using namespace std;

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

vector <int> edge[100005];
queue <int> NodeQueue;

int visited[100005], dist[100005];
int n,m,k;

void BFS (int node)
{
    visited[node]=1;
    dist[node]=0;
    NodeQueue.push(node);
    while (!NodeQueue.empty())
    {
        node = NodeQueue.front();
        for (int i = 0; i < (int)edge[node].size(); ++i)
            if (!visited[i])
            {
                dist[i] = dist[node] + 1;
                NodeQueue.push(i);
                visited[node]=1;
            }
        NodeQueue.pop();
    }
}

int main()
{
    int x,y,counter;
    fin >>n >>m >>k;
    for (int i = 1; i <= m; ++i)
    {
        fin >>x >>y;
        edge[x].push_back(y);
    }
    for (int i = 1; i <= n; ++i)
        dist[i]=-1;
    BFS(k);
    for (int i = 1; i <= n; i++)
        fout <<dist[i] <<' ';
    fout <<'\n';
    return 0;
}