#include <iostream>
#include <queue>
#include <vector>
#include <fstream>
using namespace std;
const int NMax= 1e5+2;
queue <int > q;
vector <int> v[NMax];
bool vizitat[NMax]={0};
int N, M;
int D[NMax];

void bfs(int nod)
{
    D[nod]=0;
    vizitat[nod]=true;
    q.push(nod);
    int nodCurent;
    while (!q.empty())
    {
        int next;
        nodCurent=q.front();
        q.pop();
        for (unsigned int i=0; i<v[nodCurent].size(); i++)
        {
            next=v[nodCurent][i];
            if (!vizitat[next])
            {
                vizitat[next]=true;
                q.push(next);
                D[next]=D[nodCurent]+1;
            }
        }
    }
}

void citire()
{
    ifstream f("bfs.in");
    int nodSursa;
    f>>N>>M>>nodSursa;
    for (unsigned int i=1; i<=N; i++)
        D[i]=-1;
    for (unsigned int i=0; i<M; i++)
    {
        int x, y;
        f>>x>>y;
        v[x].push_back(y);
    }
    bfs(nodSursa);
}
void afisare()
{
    ofstream g("bfs.out");
    for (int i=1; i<=N; i++)
        g<<D[i]<<" ";
}


int main()
{
    citire();
    afisare();
    return 0;
}