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

const int INF = 2000000000;
using namespace std;


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


int n, m, source;
vector <vector<int>> adj;
vector<int> dist;


void BFS(int source){
    queue<int> q;
    q.push(source);
    dist[source] = 0;
    while(!q.empty()){
        int curr = q.front();
        q.pop();
        for(int i: adj[curr]){
            if(dist[i] > dist[curr]+1){
                q.push(i);
                dist[i] = dist[curr] + 1;
            }
        }

    }

    for(int i=1; i<=n; i++){
        
        if (dist[i] != INF ){
            fout << dist[i] << ' ';
        } else {
            fout << "-1 ";
        }
        
    }
}

int main(){

    fin >> n >> m >> source;

    adj.resize(n + 1);
    dist.resize(n + 1);

    for(int i=1; i<=n; i++){
        dist[i] = INF;
    }

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

    BFS(source);

    return 0;
}