#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <bits/stdc++.h>

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

vector <int> a[100005];
int n, m, s, viz[100005];
queue <int> q;

int main()
{
    int i, j, x, y, p, u, k;

    f>>n>>m>>s;

    for (i=1; i<=m; i++)
    {
        f>>x>>y;
        a[x].push_back(y);
    }

    memset(viz, -1, sizeof(viz));

    q.push(s); viz[s]=0;
    while ( !q.empty() )
    {
        k=q.front();
        q.pop();
        for (i=0; i<a[k].size(); i++)
          if ( viz[ a[k][i] ]== -1 )
          {
              viz[ a[k][i] ] = viz[k]+1;
              q.push( a[k][i] );
          }
    }

    for (i=1; i<=n; i++)
      g<<viz[i]<<" ";
    return 0;
}