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

using namespace std;

vector <int> graph[100005];
int viz[100005],coada[100005],dist[100005];

int main()
{
    ifstream f("bfs.in");
    ofstream g("bfs.out");
    int n,m;
    f>>n>>m;
    int s;
    f>>s;
    int i,a,b;
    for(i=0;i<m;i++)
    {
        f>>a>>b;
        graph[a].push_back(b);
    }
    dist[s]=0;
    viz[s]=1;
    coada[1]=s;
    int left,right;
    left=1;
    right=1;
    while(left<=right)
    {
        int index=coada[left];
        int lim=graph[index].size();
        for(i=0;i<lim;i++)
        {
            int vecin=graph[index][i];
            if(!viz[vecin])
            {
                dist[vecin]=dist[index]+1;
                viz[vecin]=1;
                coada[++right]=vecin;
            }
        }
        left++;
    }
    for(i=1;i<=n;i++)
    {
        if(viz[i]!=0)
            g<<dist[i]<<" ";
        else
            g<<-1<<" ";
    }
}