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

std::ifstream f("bfs.in");
std::ofstream g("bfs.out");


const int maxim = 100000;
std::vector<int> graf[maxim];
int main() {

    int n,m,s;
    f>>n>>m>>s;
    for(int i = 1;i <= m;i++) {
        int n1, n2;
        f >> n1 >> n2;
        graf[n1].push_back(n2);
    }
    std::queue<int> q;
    std::vector<int> dist(n + 1, 0);
    dist[s] = 1;
    q.push(s);
    while(!q.empty())
    {
        int i = q.front();
        q.pop();
        for(int vecin:graf[i]){
            if(dist[vecin] == 0)
            {
                q.push(vecin);
                dist[vecin] = dist[i] + 1;
            }
        }
    }
    for(int i = 1;i<=n;i++){
        std::cout<<dist[i] - 1<<" ";
    }
    return 0;
}