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

using namespace std;

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

int n, m, s;

#define nmax 100005

int distante[nmax];

vector <int> ar[nmax];

queue <int> coada;

void bfs()
{
    int nod;
    distante[s]=0;
    while(!coada.empty())
    {
        nod=coada.front();
        coada.pop();
        for(unsigned int i=0;i<ar[nod].size();i++)
        {
            int vec=ar[nod][i];
            if(distante[vec]==-1)
            {
                distante[vec]=distante[nod]+1;
                coada.push(vec);
            }
        }
    }
}
void citire()
{
    int x, y, i;
    in>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        in>>x>>y;
        ar[x].push_back(y);
    }
    for(i=0;i<=n;i++)
        distante[i]=-1;
    coada.push(s);
    bfs();
    for(i=1;i<=n;i++)
        out<<distante[i]<<" ";

}
int main()
{
    citire();

    return 0;
}