#include<bits/stdc++.h>
using namespace std;
int d[100005],n,m,i,s,x,y;
vector <int> mu[100005];
queue <int> coada;
ifstream in("bfs.in");
ofstream out("bfs.out");
void bfs()
{
    int x,vec;
    while (!coada.empty())
    {
        x=coada.front();
        coada.pop();
        for (int i=0;i<=mu[x].size();i++)
        {
            vec=mu[x][i];
            if (d[vec]==-1)
            {
                //cout<<vec<<endl;
                d[vec]=d[x]+1;
                coada.push(vec);
            }
        }
    }
}
int main()
{
    in>>n>>m>>s;
    for (i=1;i<=m;i++)
    {
        in>>x>>y;
        mu[x].push_back(y);
    }
    for (i=1;i<=n;i++)
        d[i]=-1;
    d[s]=0;
    coada.push(s);
    bfs();
    for (i=1;i<=n;i++)
        out<<d[i]<<" ";
}