#include <bits/stdc++.h>

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

const int nlim=100005;
vector <int> muchii[nlim];
int dist[nlim];

int n,m,ins=0;

queue <int> coada;

void bfs()
{
    int nod;
    int vecin;
    while(!coada.empty())
    {
        nod=coada.front();
        coada.pop();
        for(unsigned int i=0; i<muchii[nod].size(); i++)
        {
            vecin=muchii[nod][i];
            if(dist[vecin]==-1)
            {
                coada.push(vecin);
                dist[vecin]=dist[nod]+1;
            }
        }
    }
}
void citire()
{
    int nodstart;
    fin>>n>>m>>nodstart;
    for(int i=1; i<=m; i++)
    {
        int x,y;
        fin>>x>>y;
        muchii[x].push_back(y);
    }
    for(int i=1; i<=n; i++)
        dist[i]=-1;
    dist[nodstart]=0;
    coada.push(nodstart);
    bfs();
    for(int i=1;i<=n;i++)
    {
        fout<<dist[i]<<" ";
    }
}
int main()
{
    citire();
}