#include <bits/stdc++.h>
#define maxv 100005
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
int n,m,s;
int d[maxv],viz[maxv];
vector<int>lista[maxv];
queue<int>q;
void citire()
{
   in>>n>>m>>s;
   int x,y;
   for(int i=1;i<=m;i++)
   {
       in>>x>>y;
       lista[x].push_back(y);
   }
}
void bfss(int node)
{
    q.push(node);
    viz[node]=1;
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(int i=0;i<lista[nod].size();i++)
        {
            if(!viz[lista[nod][i]])
            {
                q.push(lista[nod][i]);
                viz[lista[nod][i]]=1;
                d[lista[nod][i]]=d[nod]+1;
            }
        }
    }
}
int main()
{
    citire();
    bfss(s);
    for(int i=1;i<=n;i++)
    {
        if(viz[i])
            out<<d[i]<<" ";
        else
            out<<-1<<" ";
    }
    return 0;
}