//#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
const int Max=100005;
vector <int >v[Max];
queue <int>q;
int n,m,s,d[Max];
void citire()
{
   in>>n>>m>>s;
   for(int i=1;i<=m;i++)
   {
       int x,y;
       in>>x>>y;
       v[x].push_back(y);
   }

}
void bfs(int s)
{
    q.push(s);
    for(int i=1;i<=n;i++)
        d[i]=100005;
    d[s]=0;
    while(!q.empty())
    {
        int nod=q.front(); q.pop();
        for(int j=0;j<v[nod].size();j++)
        {
            int vecin=v[nod][j];
            if(d[vecin]>d[nod]+1)
            {
                d[vecin]=d[nod]+1;
                q.push(vecin);
            }
        }
    }
}
int main()
{
   citire();
   bfs(s);
   for(int i=1;i<=n;i++)
    if(d[i]!=100005)
    out<<d[i]<<" ";
   else
    out<<"-1"<<" ";
    return 0;
}