#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;
    int par[100], d[100];
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];
}

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;

    list <int> queue;
    int k = 0;

    visited[s] = true;
    queue.push_back(s);

    while(!queue.empty())
    {
        s = queue.front();
        par[k++] = s;
        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]);
            }
        }
    }
    for(int i = 0; i <= V; i++) d[i] = -1;
    for(int i = 0; i < k; i++)
        if(i == 0 || i == 1)
            d[par[i]] = i;
        else
            d[par[i]] = i-1;
    for(int i = 1; i <= V; i++)
        fout<<d[i]<<" ";

    fout.close();
}

int main()
{
    int n, m, s, a, b;
    fin>>n>>m>>s;
    Graph g(n, m);
    for(int i = 0; i < m; i++)
    {
        fin>>a>>b;
        g.addEdge(a, b);
    }
    g.BFS(s);
    fin.close();
    return 0;
}