#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

#define INF 2e9

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 nod = q.front();
        q.pop();
        for (int i: adj[nod]){
            if(dist[i] > dist[nod] +1){
                q.push(i);
                dist[i] = dist[nod] +1;
            }
        }
    }
    for(int i =1; i<=n; i++){
        fout<<(dist[i] == INF ? -1 : dist[i]) <<" ";
    }
    fout<<endl;
}

int main()
{
    fin>>n>>m>>source;
    adj.resize(n+5);
    dist.resize(n+5);

    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;
}