#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
using namespace std;
#define MAX 100005
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector < int > v[MAX];
queue < int > coada;
int viz[MAX], cost[MAX];
int main()
{
    int n, m, s, a, b;
    fin >> n >> m >> s;

    for(int i = 1; i<=m; i++)
    {
        fin >> a >> b;
        v[a].push_back(b);
    }
    coada.push(s);
    viz[s] = 1;
    while(!coada.empty())
    {
        int nod = coada.front();
        coada.pop();
        for(int i = 0; i < v[nod].size(); i++)
        {
            int 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;
}