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

using namespace std;

int main() {
    ifstream fin("bfs.in");
    ofstream fout("bfs.out");

    int n, m, start;
    fin >> n >> m >> start;

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

    // Initialize distances with -1 (meaning unreachable)
    vector<int> d(n + 1, -1);
    vector<bool> vis(n + 1, false);
    
    queue<int> q;

    // Setup starting node
    q.push(start);
    vis[start] = true;
    d[start] = 0;

    while(!q.empty()) {
        int nod = q.front();
        q.pop();

        for(const auto& v : adj[nod]) {
            if(!vis[v]) {
                vis[v] = true;      
                d[v] = d[nod] + 1;  
                q.push(v);
            }
        }
    }

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

    return 0;
}