#include <iostream>
#include <fstream>
#include <queue>
#define NMAX 100005
using namespace std;

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

int n, m, s, v[NMAX];
queue <int> Q;
vector <int> G[NMAX];

void citire()
{
    fin>>n>>m>>s;
    int x, y;
    for(int i=0; i<m; ++i)
    {
        fin>>x>>y;
        G[x].push_back(y);
    }
}
void rezolvare()
{
    Q.push(s);
    v[s]=1;
    vector <int>::iterator it;
    while(!Q.empty())
    {
        int x=Q.front();
        Q.pop();
        for(it=G[x].begin(); it!=G[x].end(); ++it)
        {
            if(v[*it]==0)
               {
                   Q.push(*it);
                   v[*it]=1+v[x];
               }
        }
    }
}
int main()
{
    citire();
    rezolvare();
    for(int i=1; i<=n; ++i)
        fout<<v[i]-1<<" ";
    return 0;
}