#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define NMAX 1000000
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
vector <int> graf[NMAX];
queue <int> coada;
int distanta[NMAX];
void BFS()
{
    int nod,vecin;
    while(!coada.empty())
    {
        nod = coada.front();
        coada.pop();
        for(unsigned int i=0; i<graf[nod].size();i++)
        {
            vecin = graf[nod][i];
            if(distanta[vecin] == -1)
            {
                coada.push(vecin);
                distanta[vecin] = distanta[nod]+1;
            }
        }
    }
}
int main()
{
    int n,m,s,a,b;
    f>>n>>m>>s;
    for(int i=1; i<=m; i++)
    {
        f>>a>>b;
        graf[a].push_back(b);//graf orientat
    }
    for(int i=1; i<=n; i++)
        distanta[i] = -1;
    distanta[s] = 0;
    coada.push(s);
    BFS();
    for(int i=1; i<=n; i++)
        g<<distanta[i]<<" ";
    return 0;
}