#include <iostream>
#include <fstream>

using namespace std;

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

int viz[100005],a[10005][10005],c[100005],noduri[100005],n,m;

int bfs(int nod)
{
    int p,u,v;
    p=1,u=1;
    viz[nod]=1;
    c[u]=nod;
    while(p<=u)
    {
        v=c[p];
        for(int i=1;i<=n;i++)
            if(viz[i]==0 && a[v][i]==1)
            {
                u++;
                c[u]=i;
                viz[i]=1;
                noduri[i]+=(noduri[v]+1);
            }
        p++;
    }

}

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

    fin>>n>>m>>s;
    for(i = 1; i <= m; i++)
    {
        fin>>x>>y;
        a[x][y]=1;
    }
    bfs(s);
    for(i=1;i<=n;i++)
        if(noduri[i]==0 && i!=s)
            fout<<-1<<' ';
        else
            fout<<noduri[i]<<' ';
}