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

#define NMAX 100005
#define MMAX 1000000

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

int n, m, S, v[NMAX], pas=-1;
vector <int> q[NMAX];
queue <int> c;

void read()
{
    fin>>n>>m>>S;
    for(int i=1; i<=m; i++)
    {
    int x, y;
    fin>>x>>y;
    q[x].push_back(y);
    }
    for(int i=1; i<=n; i++)
    v[i]=-1;
}

void bfs(int nod)
{
     c.push(nod);
     v[nod]=0;
     while(!c.empty())
     {
     nod=c.front();
     c.pop();
     for(unsigned int i=0; i<q[nod].size(); i++)
     {
     int next=q[nod][i];
     if(v[next]==-1)
     {
     c.push(next);
     v[next]=v[nod]+1;
     }
     }
     }
}

int main()
{
    read();
    bfs(S);
    for(int i=1; i<=n; i++)
    fout<<v[i]<<" ";
    return 0;
}