#include <fstream>

using namespace std;

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

const int N=100002;
const int M=1000002;
int nr,lst[N],urm[2*M],vf[2*M],d[N],q[N],n,m;

void adauga (int x, int y)
{
    vf[++nr]=y;
    urm[nr]=lst[x];
    lst[x]=nr;
}
void bfs (int xx)
{
    int st,dr;
    for (int i=1;i<=n;i++)
        d[i]=-1;
    st=0;
    dr=-1;
    q[++dr]=xx;
    d[xx]=0;
    while (st<=dr)
    {
        int x=q[st++];
        for (int p=lst[x];p!=0;p=urm[p])
        {
            int y=vf[p];
            if (d[y]==-1)
            {
                q[++dr]=y;
                d[y]=d[x]+1;
            }
        }
    }
}

int main()
{
    int s,x,y;
    fin>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y;
        adauga(x,y);
    }
    bfs(s);
    for(int i=1;i<=n;i++)
        fout<<d[i]<<" ";
    return 0;
}