#include <bits/stdc++.h>

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

#define nmax 100001

vector < int  > G[nmax];
int n,m,s,x,y;
bitset<nmax> v;
int Nivel[nmax];
queue <int > q;




int main()
{
    fin>>n>>m>>s;
    while(m)
    {
        fin>>x>>y;
        G[x].push_back(y);

        m--;
    }


    v[s]=1;

    q.push(s);
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();

        for(int i=0;i<G[nod].size();i++)
           if(v[G[nod][i]]==0)
           {
               v[G[nod][i]]=1;
               q.push(G[nod][i]);
               Nivel[G[nod][i]]=Nivel[nod]+1;
           }

    }

    for(int i=1;i<=n;i++)
    {
        if(Nivel[i]==0 && i!=s)
            fout<<-1;
        else
            fout<<Nivel[i];
        fout<<" ";


    }






    return 0;
}