#include <bits/stdc++.h>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
queue < int > q;
vector < int > v[100001];
int vis[100001],n,m,s,x,y,nod,vec;
int main()
{
    f>>n>>m>>s;
    for(int i=1;i<=m;++i)
    {
      f>>x>>y;
      v[x].push_back(y);
    }
    q.push(s);
    vis[s]=1;
    while(!q.empty())
    {
      nod=q.front();
      for(int i=0;i<v[nod].size();i++)
      {vec=v[nod][i];
        if(!vis[vec])
        {
          vis[vec]=vis[nod]+1;
          q.push(vec);
        }
      }
      q.pop();
    }
    for(int i=1;i<=n;++i)
    {
      g<<vis[i]-1<<" ";
    }
    return 0;
}