#include <iostream>
#include <fstream>

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

bool verif[100001];
long int st,dr,p[1000001],drum[100001],k,n,m,s,a,b,v[100001];
void bfs(int s)
{
    st=dr=1;
    p[st]=s;
    drum[s]=0;
    verif[s]=1;
    while(st<=dr)
    {
        for(int i=1;i<=n;i++)
        {
            if(v[p[st]]==i and verif[i]==0)
            {
                drum[i]=drum[p[st]]+1;
                p[++dr]=i;
                verif[i]=1;
            }
        }
        st++;
    }
}
int main()
{
    f>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        f>>a>>b;
        v[a]=b;
    }
    bfs(s);
    for(int i=1;i<=n;i++)
    if(drum[i]==0 and i!=s)
        g<<-1<<" ";
    else
        g<<drum[i]<<" ";


    return 0;
}