#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");

int n, m;
vector <int> muchii[100001];
int distanta[100001];
queue <int> coada;
void bfs()
{
    int nod, vecin;
    while(!coada.empty())
    {
        nod=coada.front();
        coada.pop();
        for (unsigned int i= 0; i<muchii[nod].size();i++)
        {
            vecin = muchii[nod][i];
           if(distanta[vecin]==-1)
            {
                coada.push(vecin);
                distanta[vecin]=distanta[nod]+1;
            }
        }
    }
}
int main()
{
    int nods;
    f>>n>>m>>nods;
    for (int i =1; i<=m; i++)
    {
        int x,y;
        f>>x>>y;
        muchii[x].push_back(y);
    }
    for (int i=1; i<=n; i++)
        distanta[i]=-1;
    distanta[nods]=0;

    coada.push(nods);
    bfs();
    for (int i=1;i<=n;i++)
    {
        g<<distanta[i] <<" ";
    }
    return 0;
}