#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
using namespace std;

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

vector <int> muchii[100001];
queue <int> q;
bool visited[100001];
int n, m, s, d[100001];

void BFS(int nod)
{ q.push(nod);
  d[nod]=0;
  visited[nod]=1;
  while (!q.empty())
  { nod=q.front();
    ///cout<<nod;
    q.pop();
    for (auto next:muchii[nod])
      if (!visited[next])
      { q.push(next);
        visited[next]=1;
        d[next]=d[nod]+1;
      }
  }
}

int main()
{
    f>>n>>m>>s;
    for (int i=1;i<=m;i++)
    { int x, y;
      f>>x>>y;
      muchii[x].push_back(y);
    }
    BFS(s);
    for (int i=1;i<=n;i++)
        if (d[i]==0 && s==i)
            g<<0<<" ";
        else if (d[i]==0)
            g<<-1<<" ";
        else g<<d[i]<<" ";
    return 0;
}