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

using namespace std;

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

int const nlim = 100005;

vector <int> much[nlim];

int dis[nlim];

queue <int> cod;

void bfs()
{
    int nod,vecin;
    while(!cod.empty())
    {
        nod = cod.front();
        cod.pop();
        for(unsigned int i = 0; i < much[nod].size(); i ++ )
        {
            vecin = much[nod][i];
            if ( dis[vecin] == -1 )
            {
                cod.push(vecin);
                dis[vecin] = dis[nod] + 1 ;
            }
        }
    }
}
int main()
{
    int start;
    int n, m;
    in >> n >> m >> start;
    for (int i = 1; i <= m ; i ++ )
    {
        int a, b;
        in >> a >> b;
        much[a].push_back(b);
    }
    for(int i = 1; i <=n; i ++ )
    {
        dis[i] = -1;
    }
    dis[start] = 0;
    cod.push(start);
    bfs();
    for (int i = 1; i <= n ; i ++ )
    {
        out << dis[i] << " " ;
    }
    return 0;
}