#include <iostream>
#include <vector>
#include <list>
#include <fstream>

using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
class Graph
{
    int V, M;
    vector<int> *adj;
public:
    Graph(int V, int M);
    void addEdge(int v, int w);
    void BFS(int s);
};

Graph::Graph(int V, int M)
{
    this->V = V;
    this->M = M;
    adj = new vector<int>[M];

    int a, b;
    for(int i = 0; i < M; i++)
    {
        fin>>a>>b;
        this->addEdge(a, b);
    }
}

void Graph::addEdge(int v, int w)
{
    adj[v].push_back(w);
}

void Graph::BFS(int s)
{
    bool *visited = new bool[V+1];
    for(int i = 0; i <= V; i++)
        visited[i] = false;

    vector <int> dist (V+1,-1);
    list <int> queue;

    visited[s] = true;
    queue.push_back(s);
    dist[s] = 0;
    while(!queue.empty())
    {
        s = queue.front();
        queue.pop_front();
        for(int i = 0; i < adj[s].size(); i++)
        {
            if (!visited[adj[s][i]])
            {
                visited[adj[s][i]] = true;
                queue.push_back(adj[s][i]);
                dist[adj[s][i]] = dist[s] + 1;
            }
        }
    }
     for(int i = 1;i<= V;i++){
        fout<<dist[i]<<" ";
    }

    fout.close();
}

int main()
{
    int n, m, s;
    fin>>n>>m>>s;
    Graph g(n, m);
    g.BFS(s);
    fin.close();
    return 0;
}