#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

vector <int> v[100005];

queue <int> coada;

int w[100005];

void functie()
{
    int j,x,i,lungime_pana_acm;

    while(!coada.empty())
    {
        x=coada.front();
        coada.pop();

        lungime_pana_acm=w[x];

        for(i=0;i<v[x].size();i++)
        {
            j=v[x][i];

            if(w[j]>lungime_pana_acm+1)
            {
                w[j]=lungime_pana_acm+1;
                coada.push(j);
            }

        }

    }





}


int main()
{
    int n,m,s,i,x,y;

    fin>>n>>m>>s;

    for(i=1;i<=n;i++)
        w[i]=n+5;


    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);

    }

    w[s]=0;
    coada.push(s);

    functie();

    for(i=1;i<=n;i++)
        if(w[i]<n+5)
            fout<<w[i]<<" ";
        else
            fout<<-1<<" ";


    return 0;
}