#include <bits/stdc++.h>
#define MAX 100100
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
bool uz[MAX];
int cost[MAX];
queue<int>coada;
vector<int>g[MAX];
int n,m,s;
void citire();
void bfs();
int main()
{
    int i;
    citire();
    bfs();
    for(i=1; i<=n; i++)
        if(cost[i]==0)
            cost[i]=-1;
    cost[s]=0;
    for(i=1; i<=n; i++)
        fout<<cost[i]<<' ';
    return 0;
}
void citire()
{
    int i,x,y;
    fin>>n>>m>>s;
    for(i=1; i<=m; i++)
    {
        fin>>x>>y;
        g[x].push_back(y);
    }
}
void bfs()
{
    int nodcrt,i;
    coada.push(s);
    uz[s]=1;
    while(!coada.empty())
    {
        nodcrt=coada.front();
        coada.pop();
        for(i=0; i<g[nodcrt].size(); i++)
        {
            if(uz[g[nodcrt][i]]==0)
            {
                coada.push(g[nodcrt][i]);
                cost[g[nodcrt][i]]=cost[nodcrt]+1;
                uz[g[nodcrt][i]]=1;
            }
        }
    }
}