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

using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");

#define MAXN 100005
#define INF 0x3f3f3f3f

vector<int> graf[MAXN];
queue<int> coada;
int dist[MAXN];
int n,m,i,j,x,y,start,nod;

int main()
{
    cin>>n>>m>>start;
    for(i=1; i<=m; i++)
    {
        cin>>x>>y;
        graf[x].push_back(y);
    }

    for(i=1; i<=n; i++)
        dist[i]=INF;

    coada.push(start); dist[start] = 0;
    while(!coada.empty())
    {
        nod=coada.front(); coada.pop();
        for(i=0; i<graf[nod].size(); i++)
            if( dist[ graf[nod][i] ] > dist[nod] + 1)
            {
                dist[ graf[nod][i] ] = dist[nod] + 1;
                coada.push( graf[nod][i] );
            }
    }

    for(i=1; i<=n; i++)
        if(dist[i] == INF)
            cout<<"-1 ";
        else
            cout<<dist[i]<<" ";
    return 0;
}