#include <iostream>
#include <vector>
#include <fstream>
#include <queue>
using namespace std;
#define MAX 100005
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector < int > v[MAX];
queue  < int > coada;
bool viz[MAX];
int cost[MAX];
int main()
{
    int n, m, a, b,s;
    fin >> n >> m >> s;
    for (int i = 1; i<=m; i++) {
            fin >> a >> b;
            v[a].push_back(b);
    }
    coada.push(s);
    viz[s]=true;
    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]==false) {
                coada.push(vecin);
                cost[vecin] = cost[nod] + 1;
                viz[vecin] = true;
            }
        }
    }
    for (int i = 1; i<=n; i++) {
        if(viz[i]==0)
            fout << -1 << " ";
        else fout << cost[i] << " ";
    }
    fin.close();
    fout.close();
    return 0;
}