#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
const int NMax = 100000;
vector <int> G[NMax + 5];
queue <int> Q;
int N,M,S,D[NMax + 5];
void Read()
{
    fin >> N >> M >> S;
    for(int i = 1; i <= M; ++i)
    {
        int x,y;
        fin >> x >> y;
        G[x].push_back(y);
        //G[y].push_back(x);
    }
}

void BFS(int Source)
{
    for(int i = 1; i <= N; ++i)
        D[i] = -1;
    Q.push(Source);D[Source] = 0;
    while(!Q.empty())
    {
      int Nod = Q.front(); Q.pop();
      for(auto Vecin : G[Nod])
      {
          if(D[Vecin] == -1)
          {
                D[Vecin] = D[Nod] + 1;
                Q.push(Vecin);
          }
      }
    }
}

void Print()
{
    for(int i = 1; i <= N; ++i)
    {
        fout << D[i] << " ";
    }
    fout << "\n";
}

int main()
{
    Read();
    BFS(S);
    Print();
    return 0;
}