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

using namespace std;

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

vector<vector<int>> A;
int vis[100005];
int n,m,start;
int coada[100005];


void BFS(int start){
    for(int i = 1; i <=100000; i++){
        vis[i]=-1;
    }
    int coadalen = 1;
    coada[1] = start;
    vis[start] = 0;
    for(int i = 1; i <= coadalen; i++){
        for(int j = 0; j < A[coada[i]].size(); j++){
            if(vis[A[coada[i]][j]] == -1){
                vis[A[coada[i]][j]] = vis[coada[i]] + 1;
                coada[++coadalen]=A[coada[i]][j];
            }
        }
    }

}


int main()
{
    fin>>n>>m>>start;
    A.resize(n+1);
    int a, b, cnt=0;
    for(int i = 1; i <=m; i++){
        fin>>a>>b;
        A[a].push_back(b);
    }
    BFS(start);
    for(int i = 1; i<=n; i++){
        fout<<vis[i]<<' ';
    }

    return 0;
}