#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#define NMAX 100000 // NMAX==KMAX
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
vector <int> a[NMAX+5];
int n,m,mu,x,y,nrc,k,p,q,c[NMAX+5],dist[NMAX+5];
bool viz[NMAX+5];
void reset()
{
    int i;
    for(i=1;i<=n;i++)
        viz[i]=0;
}
void bfs(int nc)
{
    int inc,sf,i,fr;
    inc=sf=1;
    viz[nc]=1;
    c[1]=nc;
    dist[nc]=0;
    while(inc<=sf)
    {
        fr=c[inc];
        for(i=0;i<a[fr].size();i++)
            if(!viz[a[fr][i]])
            {
                c[++sf]=a[fr][i];
                viz[a[fr][i]]=1;
                dist[a[fr][i]]=dist[fr]+1;
            }
        inc++;
    }
}
int main()
{
    int i;
    in>>n>>m>>p;
    for(i=1;i<=m;i++)
    {
        in>>x>>y;
        a[x].push_back(y); // ORIENTAT
    }
    bfs(p);
    for(i=1;i<=n;i++)
        if(i!=p and dist[i]==0)
            dist[i]=-1;
    for(i=1;i<=n;i++)
        out<<dist[i]<<' ';
    return 0;
}