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

using namespace std;

class Graph {
    private:
        int n;
        int m;
        int start;
        vector<vector<int>> adjList;
        vector<int> dist;
        queue<int> q;
    public:
        Graph() {};
        void directedGraph();
        void undirectedGraph();
        void bfs();
        void dfs(int start);
        void nrCompConexe();
};

void Graph :: directedGraph() {
    ifstream fin("bfs.in");

    fin >> n >> m >> start;

    adjList.resize(n + 1);

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

    fin.close();
}
void Graph :: bfs() {
    ofstream fout("bfs.out");

    q.push(start);

    dist.resize(n + 1);
    for (int i = 1; i <= n; i++)
        dist[i] = -1;
    dist[start] = 0;

    while (!q.empty()) {
        int nod = q.front();
        q.pop();
        for (auto i : adjList[nod])
            if (dist[i] == -1) {
                dist[i] = dist[nod] + 1;
                q.push(i);
            }
    }

    for (int i = 1; i <= n; i++)
        fout << dist[i] << " ";

    fout.close();
}

void Graph :: dfs(int start) {
}
int main()
{
    Graph X;
    X.directedGraph();
    X.bfs();
    return 0;
}