#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
queue <int> Q;
const int Nmax=100000+5;
vector<int>v[Nmax];
int c[Nmax];
int n,m,source;
int main()
{
    fin>>n>>m>>source;
    for(int i=1,x,y;i<=m;++i)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    //for(int i=1;i<=n;++i,fout<<'\n')
        //for(int j=0;j<v[i].size();++j)
        //fout<<v[i][j]<<" ";
    for(int i=1;i<=n;++i)
        c[i]=-1;
    c[source]=0;
    Q.push(source);
    for(int i;!Q.empty();)
    {
        //cout<<Q.front()<<" ";
        i=Q.front();
        Q.pop();
        for(int j=0;j<v[i].size();++j)
            if(c[v[i][j]]>c[i]+1 or c[v[i][j]]==-1)
            {
                //cout<<"nod"<<v[i][j]<<" ";
                c[v[i][j]]=c[i]+1;
                Q.push(v[i][j]);
            }
    }
    for(int i=1;i<=n;++i)
        fout<<c[i]<<" ";
    return 0;
}