#include<iostream>
#include<vector>
#include<fstream>
#include<queue>
#define maxnumber 100004

using namespace std;

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

int i,n,m,k,start,nod,x,y,d[maxnumber];
vector <int> v[maxnumber];
queue <int> q;

int main()
{
    fin>>n>>m>>start;

    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    for(i=1;i<=n;i++) d[i]=-1;

    d[start]=0;
    q.push(start);
    while(! q.empty() )
    {
        nod=q.front();
        q.pop();
        for(i=0;i<v[nod].size();i++)
        {
            if(d[v[nod][i]] < 0)
            {d[v[nod][i]]=d[nod]+1;
                q.push(v[nod][i]);}
        }
    }
    for(i=1;i<=n;i++)
    {
        fout<<d[i]<<" ";
    }

}