#include <bits/stdc++.h>
#define MAX 100100
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector <int>g[MAX];
queue <int>coada;
int lg[MAX],start,n,m;
bool uz[MAX];
void citire();
void bfs(int node);
int main()
{
    int i;
    citire();
    bfs(start);
    for(i=1;i<=n;i++)
        if(lg[i]==0&&i!=start)
        fout<<-1<<' ';
    else
        fout<<lg[i]<<' ';
}
void citire()
{
    int i,x,y;
    fin>>n>>m>>start;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        g[x].push_back(y);
    }
}
void bfs(int node)
{
   int nodecrt,i;
   uz[node]=1;
   coada.push(node);
   while(!coada.empty())
   {
       nodecrt=coada.front();
       coada.pop();
       for(i=0;i<g[nodecrt].size();i++)
        if(!uz[g[nodecrt][i]])
       {
           lg[g[nodecrt][i]]=lg[nodecrt]+1;
           coada.push(g[nodecrt][i]);
           uz[g[nodecrt][i]]=1;
       }
   }
}