#include <fstream>
#include <vector>
using namespace std;
ifstream fin ("bfs.in");
ofstream fout ("bfs.out");
int n,m,s,p,vecin,nod,q,i,x,y,viz[100005],coada[100005],d[100005];
vector <int> v[100005];
int main()
{
    fin>>n>>m>>s;
    for (i=1; i<=m; i++)
    {
        fin>>x>>y;
        v[x].push_back (y);
    }
    p=q=1;
    coada[q]=s;
    viz[s]=1;
    d[s]=1;
    while (p<=q)
    {
        nod=coada[p];
        for (i=0; i<v[nod].size (); i++)
        {
            vecin=v[nod][i];
            if (viz[vecin]==0)
            {
                coada[++q]=vecin;
                viz[vecin]=1;
                d[vecin]=d[nod]+1;
            }
        }
        p++;
    }
    for (i=1; i<=n; i++)
        fout<<d[i]-1<<" ";
    return 0;
}