#include <bits/stdc++.h>
using namespace std;
int main(){
    int n, m, s, x, y, viz[1000],distance[1000];
    ifstream fi("bfs.in");
    ofstream fo("bfs.out");
    fi>>n>>m>>s;
    vector <int> v[1000];
    queue <int> q;

    for (int i=1; i<=m; i++) {fi>>x>>y;
        v[x].push_back(y);}
    for (int i= 1; i<=n; i++) distance[i]=-1;
    q.push(s);
    distance[s]=0;viz[s]=1;
    while (!q.empty())
    {
        int x=q.front();
        q.pop();
        for (auto & i :v[x])
        {
            int neigh=v[x][i];
            if (!viz[neigh])
            {
                viz[neigh]=1;
                distance[neigh]=distance[x]+1;
                q.push(neigh);
            }
        }
    }

    for (int i=1;i<=n;i++)
        fo<<distance[i]<<" ";

    return 0;
}