#include <iostream>
#include <fstream>

#include <vector>
#include <queue>

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");
vector<vector<int>> lista;
queue<int> q;
vector<int> distanta;

int main()
{
    int n,m,s;
    f >> n >> m >> s;
    int x,y ;
    lista.resize(n+1);
    distanta.resize(n+1,-1);
    q.push(s);
    distanta[s] = 0;
    while(f >> x >> y)
    {
        lista[x].push_back(y);
    }
    while(!q.empty())
    {
        int curr = q.front();
        q.pop();
        for(auto vecin : lista[curr]){
            if(distanta[vecin] == -1){
                distanta[vecin] = distanta[curr] + 1;
                q.push(vecin);
            }
        }
    }

    for(int i = 1; i<=n ;i++)
        g << distanta[i] << ' ' ;

    return 0;
}