#include <fstream>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
vector <int> G[100005];
queue<int>q;
int n,sel[100005],lg[100005],m,s;
void bf(int x){
sel[x]=true;
q.push(x);
while(!q.empty()){
    int nod=q.front();
    for(auto it : G[nod])
    if(!sel[it]){
        q.push(it);
        sel[it]=true;
        lg[it]=lg[nod]+1;
    }
    q.pop();
}
}
int i,x,y,p;
int main()
{
  f>>n>>m>>p;
  for(i=1;i<=m;i++)
  {f>>x>>y;
      G[x].push_back(y);
  }
  bf(p);
     for(i=1;i<=n;i++){
        if(i!=p && lg[i]!=0)g<<lg[i]<<" ";
        else if(i==p)g<<"0 ";
        else g<<"-1 ";
    }


    return 0;
}