#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

const int NMAX=1e6+1;
vector <int> graf[NMAX];
queue <int> coada;
int sol[NMAX],n,m,s;

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

void bfs()
{
    int i;
    coada.push(s);
    sol[s]=1;
    while(coada.empty()==false)
    {
        int node=coada.front();
        coada.pop();
        int p=graf[node].size();
        for(i=0;i<p;i++)
        {
            int current_node=graf[node][i];
            if(sol[current_node]==0)
            {
                sol[current_node]=sol[node]+1;
                coada.push(current_node);
            }
        }
    }
}


void afisare()
{
    for(int i=1;i<=n;i++)
        out<<sol[i]-1<<" ";
}

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