#include    <iostream>
#include    <fstream>
#include    <vector>
#include    <queue>
#include    <cstring>
#include    <algorithm>

using namespace std;

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

const int Nmax = 100005;
vector <int>v[Nmax];
queue <int>Q;
int d[Nmax];
int n, m, s;

void bfs()
{
    while(!Q.empty())
    {
          int nod = Q.front();
          Q.pop();
          for(int i = 0; i < v[nod].size(); i++)
          {
              int vecin = v[nod][i];
              if(d[vecin] == -1)
              {
                  Q.push(vecin);
                  d[vecin] = d[nod] + 1;
              }
          }
    }
}

void Citire()
{
    in>>n>>m>>s;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        in>>x>>y;
        v[x].push_back(y);
    }

    memset(d,-1,sizeof d);

    d[s] = 0;

    Q.push(s);

    bfs();

    for(int i = 1; i <= n; i++)
        out<<d[i]<<' ';
}

int main()
{
    Citire();
}