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

using namespace std;

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

void bfs(int nod_start,vector<vector<int>>&G,vector<int>&distance)
{
    queue<int>coada;
    coada.push(nod_start);
    distance[nod_start]=0;

    while(!coada.empty())
    {
        int aux=coada.front();
        coada.pop();
        for(auto vecin:G[aux])
            if(distance[vecin]>distance[aux]+1)
            {
                coada.push(vecin);
                distance[vecin]=distance[aux]+1;
            }
    }
}

int main()
{
    int n,m,i,a,b,s;
    f>>n>>m>>s;
    vector<vector<int>>G(n+1);
    vector<int>distance(n+1,n+1);

    for(i=1; i<=m; i++)
    {
        f>>a>>b;
        G[a].push_back(b);
    }

    bfs(s,G,distance);

    for(i=1; i<=n; i++)
    {
        if(distance[i]==n+1)
            distance[i]=-1;
        g<<distance[i]<<" ";
    }
    return 0;
}