# include <bits/stdc++.h>
#define dimax 100001
#define valmax 1000001
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,origine,x,y;
int cost[dimax];
queue <int> coada;
vector <int> vecini[100001];
int main()
{
    fin>>n>>m>>origine;
    for(int i=0; i<m; ++i)
    {
        fin>>x>>y;
        vecini[x].push_back(y);
    }
    for(int i=1; i<=n; ++i)
    {
        cost[i]=valmax;
    }
    cost[origine]=0;
    coada.push(origine);
    while(!coada.empty())
    {
        int nod = coada.front();
        coada.pop();
        for(auto it:vecini[nod])
        {
            if(cost[it]>cost[nod]+1)
            {
                cost[it]=cost[nod]+1;
                coada.push(it);
            }
        }
    }
    for(int i=1; i<=n; ++i)
    {
        if(cost[i]==valmax)
            fout<<-1<<' ';
        else
            fout<<cost[i]<<' ';
    }
    return 0;
}