#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,p,x,y;
vector < int > v[100005];
queue < int > coada;
int viz[100005];
void bfs ()
{
    viz[p]=1;
    coada.push(p);
    while(!coada.empty())
    {
        int x=coada.front();
        coada.pop();
        int l=v[x].size();
        for(int k=0; k<l; k++)
            if(viz[v[x].at(k)]==0)
            {
                viz[v[x].at(k)]=viz[x]+1;
                coada.push(v[x].at(k));
            }
    }
}
int main()
{
    f>>n>>m>>p;
    for(int i=1; i<=m; i++)
    {
        f>>x>>y;
        v[x].push_back(y);
    }
    bfs();
    for(int i=1; i<=n; i++)
        g<<viz[i]-1<<" ";
    return 0;
}