#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <limits.h>
using namespace std;

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

int n, m, nd, NEVIZITAT=INT_MAX;
vector<int> G[100002];
queue<int> Q;
int cost[100002],j;

void parc_latime(int plecare)   {
int i,j;
for (i=1;i<=n;i++)
    cost[i] = NEVIZITAT;//SAU memset(Cost, -1, sizeof(Cost))
cost[plecare] = 0;
Q.push(plecare);

while ( !Q.empty() )    {
    i = Q.front();
    Q.pop();
   // int e;
   // for (e=0; e<G[i].size(); e++)
    for (int & e : G[i])
        if (cost[e] == NEVIZITAT)   {
            Q.push(e);

            cost[e] = cost[i] + 1;
        }
    }
}

int main()
{
    int i, x, y;
    f>>n>>m>>nd;//nd = nod de start
    for (i=1;i<=m;i++)  {
        f>>x>>y;
        G[x].push_back(y);
    }
    parc_latime(nd);

    for (i=1;i<=n;i++)
        if (cost[i] == NEVIZITAT)
            g<<-1<<" ";
        else
            g<<cost[i]<<" ";

    return 0;
}