/*

*/

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

using namespace std;

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

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


void read()
{
    fin>>n>>m>>s;
    memset(D,-1,sizeof(D));
    for(int i=1;i<=m;i++)
    {
        int x,y;
        fin>>x>>y;
        G[x].push_back(y);
        //G[y].push_back(x);

    }
}


void bsf()
{

    Q.push(s);
    D[s]=0;
    while(!Q.empty())
    {
        int Nod=Q.front(); Q.pop();
        for(int i=0;i<(int)G[Nod].size();i++)
        {
            int vecin = G[Nod][i];
            if(D[vecin]==-1)
               {
                  D[vecin]=D[Nod]+1;
                  Q.push(vecin);
               }
        }
    }

}


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


int main()
{
    read();
    bsf();
    print();


return 0;
}