#include <cstdio>
#include <cstdlib>
#include <vector>
#include <queue>
using namespace std;

struct edge
{
       long start,end;
};

vector <edge> v;
vector <long> cost(100001,-1);
long n,m,st,x,y;


void read_input()
{
     scanf("%ld %ld %ld", &n,&m,&st);
     for(int i=0;i<m;i++)
     {
                     scanf("%ld %ld", &x,&y);
                     edge New;
                     New.start=x;
                     New.end=y;
                     v.push_back(New);
     }
}


void BFS(long st)
{
     cost[st]=0;
     queue <int> q;
     q.push(st);
     while(!q.empty())
     {
                      int old=q.front();
                      q.pop();
                      for(int i=0;i<m;i++)
                      {
                              if(v[i].start==old && cost[v[i].end]==-1)
                              {
                                                     q.push(v[i].end);
                                                     cost[v[i].end]=cost[v[i].start]+1;
                              }
                      }
     }
     for(int i=1;i<=n;i++) printf("%ld ", cost[i]);
}

int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    read_input();
    BFS(st);
    return 0;
}