#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
using namespace std;
vector<int> g[100010];
int dist[100010],coada[100010];
int main()
{
    ifstream fin ("bfs.in");
    ofstream fout ("bfs.out");
    int n,m,s,i,j,a,b,ic,sf,nod,dim;
    fin>>n>>m>>s;
    for(i=1; i<=m; i++)
    {
        fin>>a>>b;
        g[a].push_back(b);
    }
    memset(dist,-1,sizeof(dist));
    ic=sf=1;
    coada[1]=s;
    dist[s]=0;
    while(ic<=sf)
    {
        nod=coada[ic];
        dim=g[nod].size();
        for(i=0; i<dim; i++)
            if(dist[g[nod][i]]==-1)
            {
                dist[g[nod][i]]=dist[nod]+1;
                sf++;
                coada[sf]=g[nod][i];
            }
        ic++;
    }
    for(i=1;i<=n;i++)
        fout<<dist[i]<<" ";
    return 0;
}