#include <bits/stdc++.h>

using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int s,n,m,i,j,k,x,y;
vector<vector<int>> lista(100001);
vector<int> vec(100001);
queue<int> coada;
vector<int> cost(100001);
vector<bool> vizitat(100001,false);
void bfs()
{
    int elem;
    while(!coada.empty())
    {
        elem = coada.front();
        coada.pop();
        //int p;
        for(auto p:lista[elem])
        {
            if(cost[p] == -1)
            {
                coada.push(p);
                cost[p] = cost[elem]+1;
            }
        }
    }
    for(int i=1;i<=n;i++)
        g<<cost[i]<< " ";
}
int main()
{
    f>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        lista[x].push_back(y);
    }
    for(i=1;i<=n;i++)
    {
        cost[i] = -1;
    }
    cost[s] = 0;
    coada.push(s);
    bfs();
    return 0;
}