#include <fstream>
#include <vector>
#include <deque>
#define N 100005
using namespace std;

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

vector<int> L[N];
deque <int> coada;

 int n,m,S,lungime[N];

 bool vizitat[N];

int BF()
{
    int i,x,k=0;
    coada.push_back(S);vizitat[S]=1; lungime[S]=0;
    while(!coada.empty())
    {
        x=coada.front();coada.pop_front();
        for(i=0;i<L[x].size();i++)
        {
            if(!vizitat[L[x][i]])
            {
              coada.push_back(L[x][i]);
              lungime[L[x][i]]=lungime[x]+1;
              vizitat[L[x][i]]=1;
            }
        }
    }
}

int main()
{
    int i,x,y;
    f>>n>>m>>S;
    for (i=1; i<=m; i++)
    {
      f>>x>>y;
      L[x].push_back(y);
    }

    for(i=1;i<=n;i++) lungime[i]=-1;

    BF();

    for (i=1; i<=n; i++) g<<lungime[i]<<" ";

    f.close();g.close();
    return 0;
}