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

using namespace std;

#define MAX 100005

queue < int > coada;
vector < int > v[MAX];

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

unsigned n, m, s, x, y;
int viz[MAX], cost[MAX];

int main()
{
    fin >> n >> m >> s;
    for(int i = 1; i <= m; i++)
    {
        fin >> x >> y;
        v[x].push_back(y);
    }
    coada.push(s);
    viz[s] = 1;
    while(!coada.empty())
    {
        unsigned nod = coada.front();
        coada.pop();
        for(int i = 0; i < v[nod].size(); i++)
        {
            unsigned vecin = v[nod][i];
            if(!viz[vecin])
            {
                coada.push(vecin);
                cost[vecin] = cost[nod] + 1;
                viz[vecin] = 1;
            }
        }
    }
    for(int i = 1; i <= n; i++){
        if(viz[i] == 0)
            fout << -1 << " ";
        else
            fout << cost[i] << " ";
    }
    return 0;
}