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

using namespace std;

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

vector <vector <int>> G;
int dis[100001];

void bfs(int start){

    dis[start] = 1;
    queue <int> Q;
    Q.push(start);

    while(!Q.empty()){
        int node = Q.front();
        Q.pop();

        for(int vec : G[node]){
            if(!dis[vec]){
                dis[vec] = dis[node] + 1;
                Q.push(vec);
            }
        }
    }

}

int main()
{
    int n, m, s;
    fin>>n>>m>>s;
    G.resize(n + 1);

    for(int i = 1; i <= m; i++){
        int a, b;
        fin>>a>>b;
        G[a].push_back(b);
    }

    bfs(s);

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

    return 0;
}