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

using namespace std;

const int Nmax = 1000005;

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

vector < int > Vecini[Nmax];
queue < int > q;

int n,m,start,x,y;
int dist[Nmax];

void bfs()
{
    int nod,vecin;
    while(!q.empty())
    {
        nod=q.front();
        q.pop();

        for(unsigned int i=0;i<Vecini[nod].size();++i)
        {

            vecin=Vecini[nod][i];
            if(dist[vecin]==-1)
            {
                q.push(vecin);
                dist[vecin]=dist[nod]+1;
            }
        }
    }

}

void read()
{

    f>>n>>m>>start;
    for(int i=1;i<=m;++i)
    {
        f>>x>>y;
        Vecini[x].push_back(y);

    }
    for(int i=1;i<=n;++i)
        dist[i]=-1;
    dist[start]=0;

    q.push(start);

    bfs();

    for(int i=1;i<=n;++i)
        g<<dist[i]<<" ";

}




int main()
{
    read();
}