#include <fstream>
#include <vector>
#define NMAX 100001
using namespace std;
ifstream fin ("bfs.in");
ofstream fout ("bfs.out");
int n, start;
vector <int>a[NMAX];
int viz[NMAX]; //viz[i]=0 daca nu a fost vizitat
int C[NMAX];
int inc, sf;
void citire();
void bfs(int x);
int main()
{
   int i;
   citire();
   bfs(start);
   for (i=1; i<=n; i++)
    fout<<viz[i]-1<<' ';
   fout.close();
    return 0;
}
void citire()
{
    int k, m, x, y, i;
    fin>>n>>m>>start;
    for (i=0; i<m; i++)
    {
        fin>>x>>y;
       //y intra in lista de adiacena a lui x
       a[x].push_back(y);
    }
}
void bfs(int x)
{
    int i;
    viz[x]=1;
    C[1]=x;
    inc=sf=1;
    while (inc<=sf)
   {
       x=C[inc++];
       //parcurg varfurile adiacente cu x
    for (i=0; i<a[x].size(); i++)
        if (!viz[a[x][i]])
        {
            viz[a[x][i]]=1+viz[x];
            C[++sf]=a[x][i];
        }
   }
}