#include <bits/stdc++.h>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int i,j,n,x,s,y,poz,l[100005],nr,m;
vector<int> v[100001];
queue<pair<int,int>> q;
int main()
{ fin>>n>>m>>poz;
  for(i=1;i<=m;i++)
  {fin>>x>>y;
   v[x].push_back(y);
  }
  q.push(make_pair(poz,0));
  while(!q.empty())
  {nr=q.front().second;
   j=q.front().first;
   if(l[j]==0)
   l[j]=nr+1;
   else l[j]=min(l[j],nr+1);
   for(i=0;i<v[j].size();i++)
       if(l[v[j][i]]==0 || l[v[j][i]]>l[j]+1) q.push(make_pair(v[j][i],l[j]));
    q.pop();
  }
  for(i=1;i<=n;i++) fout<<l[i]-1<<" ";
    return 0;
}