#include<bits/stdc++.h>
#define Nmax 100005
#define Mmax 1000005
#define pb push_back

using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");

vector<int>M[Nmax];
int V[Nmax],Dis[Nmax],n,m,s;
queue<int>Q;

void bfs()
{
    int nod,vecin;
    while(!Q.empty())
    {
        nod=Q.front();
        Q.pop();
        for(unsigned int i=0;i<M[nod].size();i++)
        {
            vecin= M[nod][i];
            if(Dis[vecin]==-1)
            {
                Q.push(vecin);
                Dis[vecin]=Dis[nod]+1;
            }
        }
    }
}
void cetire()
{
    f>>n>>m>>s;
    while(m)
    {
        int x,y;
        f>>x>>y;
        M[x].pb(y);
        m--;
    }
    for(int i=1;i<=n;i++)
    {
        Dis[i]=-1;
    }
    Dis[s]=0;

    Q.push(s);
    bfs();

    for(int i=1;i<=n;i++)
        g<<Dis[i]<<" ";
}
int main()
{
    cetire();

}