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

using namespace std;
vector <int> G[100005];
queue <int> Q;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,s,m,a[100005];

void citire()
{
    fin>>n>>m>>s;
    int x,y;
    for(int i=1; i<=m; i++)
    {
        fin>>x>>y;
        G[x].push_back(y);
    }
}
void bfs()
{
    while(!Q.empty())
    {
        int x=Q.front();
        Q.pop();
        for(auto &v: G[x])///se parcurg vecinii
        {
            if(a[v]==0)///daca vecinul nu a fost parcurs, continuam din el si crestem lunimea drumului minim
            {
                Q.push(v);
                a[v]=a[x]+1;
            }
        }
    }
}
int main()
{
    citire();
    Q.push(s);
    a[s]=1;
    bfs();
    for(int i=1; i<=n; i++)
    {
        fout<<a[i]-1<<" ";
    }
    return 0;
}