#include <bits/stdc++.h>

using namespace std;

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

vector<int>a[100100];
queue<int>q;


int n,d[100100],viz[100100];


void bfs(int S)
{
    int i;

    q.push(S);
    for(i=1;i<=n;i++)d[i]=-1;
    viz[S]=1;
    d[S]=0;
    //g<<S<<" ";
    while(!q.empty())
    {

        int nod;
        nod=q.front();
      //  g<<nod<<" ";
        sort(a[nod].begin(),a[nod].end());
        for(i=0;i<a[nod].size();i++)
        {
            if(viz[a[nod][i]]==0)
            {
                //g<<a[nod][i]<<" ";
                q.push(a[nod][i]);
                d[a[nod][i]]=d[nod]+1;
                viz[a[nod][i]]=1;
            }
        }
        q.pop();
    }
}


int m,S,i,x,y;


int main()
{
    f>>n>>m>>S;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        a[x].push_back(y);
      //  a[y].push_back(x);
    }



    bfs(S);



    for(i=1;i<=n;i++)
        g<<d[i]<<" ";


    return 0;
}