#include<fstream>
#include<cstring>
#include<vector>
#include<deque>
using namespace std;
vector<int>v[100005];
deque<int>c;
int m,n,s,cost[100005];
void bfs(void)
{
  int i,x;
  while(!c.empty())
  {
    x=c.front();
    c.pop_front();
    m=v[x].size();
    for(i=0;i<=m-1;i++)
    if(cost[v[x][i]]==-1)
    {
      c.push_back(v[x][i]);
      cost[v[x][i]]=cost[x]+1;
    }
  }
}
int main()
{
    int i,x,y;
    ifstream fi("bfs.in");
    ofstream fo("bfs.out");
    fi>>n>>m>>s;
    memset(cost,-1,sizeof(cost));
    for(i=1;i<=m;i++)
    {
      fi>>x>>y;
      v[x].push_back(y);
    }
    c.push_back(s);
    cost[s]=0;
    bfs();
    for(i=1;i<=n;i++) fo<<cost[i]<<" ";
    fo<<"\n";
    fo.close();
    return 0;
}