#include <bits/stdc++.h>

using namespace std;

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

int const lim = 100001;
int n,m,s,d[lim];
vector < int > c[lim];
queue < int > q;

void bfs(int nod)
{
    d[nod]=0;
    q.push(nod);

    while( !q.empty() )
    {
        int x=q.front();
        q.pop();
        for(int i=0;i<c[x].size();i++)
        {
            if(d[c[x][i]]==-1)
            {
                d[c[x][i]]=d[x]+1;
                q.push(c[x][i]);
            }
        }
    }
}

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

   for(int i=1;i<=n;i++)
    d[i]=-1;

   bfs(s);

   for(int i=1;i<=n;i++)
    out<<d[i]<<" ";
}