#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#define NMAX 100005
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,start;
vector<int>muchie[NMAX];
void read()
{
    fin>>n>>m>>start;
    while(m)
    {
        int x,y;
        fin>>x>>y;
        muchie[x].push_back(y);
        m--;
    }
}
queue<int>coada;
int dist[NMAX];
bool sel[NMAX];
int main()
{
    read();
    coada.push(start);
    sel[start]=true;
    dist[start]=0;
    while(!coada.empty())
    {
        int i;
        i=coada.front();
        coada.pop();
        for(size_t j=0;j<muchie[i].size();j++)
            if(!sel[muchie[i][j]])
        {
            coada.push(muchie[i][j]);
            sel[muchie[i][j]]=true;
            dist[muchie[i][j]]=dist[i]+1;
        }
    }
    for(int i=1;i<=n;i++)
        if(dist[i]==0 && i!=start)fout<<-1<<" ";
    else fout<<dist[i]<<" ";
    return 0;
}