#include <queue>
#include <fstream>
#include <iostream>
#include <vector>

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

vector<int> L[100001];
queue<int> Q;
int viz[100001];
int dist[100001];
int n,m,s;

void citire()
{
    f>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        f>>x>>y;
        L[x].push_back(y);
    }
    
}


void bfs()
{
    for(int i=1; i<=n;i++)
        dist[i]=-1;

    dist[s]=0;
    Q.push(s);

    while(!Q.empty())
    {
        int nod = Q.front();
        Q.pop();

        for(auto v : L[nod])
        {
            if(dist[v] == -1)
            {
                dist[v] = dist[nod] + 1;
                Q.push(v);
            }
        }
    }
}

void afisare()
{
    for(int i=1;i<=n;i++)
    {
        g<<dist[i]<<" ";
    }
}

int main(){
    citire();
    bfs();
    afisare();
}