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

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

int n, m, s;
vector<vector<int>> gr;
bool vizitat[100005];
int lungime[100005];
int nsursa, ndestinatie;

void BFS(int nod) {
    queue<int> q;
    q.push(nod);
    vizitat[nod] = true;
    lungime[nod] = 0;

    while (!q.empty()) {
        int curent = q.front();
        q.pop();

        for (auto &vecin : gr[curent]) {
            if (!vizitat[vecin]) {
                vizitat[vecin] = true;
                lungime[vecin] = lungime[curent] + 1;
                q.push(vecin);
            }
        }
    }
}

int main() {
    fin >> n >> m >> s;
    gr.resize(n + 1);
    for (int i = 1; i <= m; ++i) {
        fin >> nsursa >> ndestinatie;
        gr[nsursa].push_back(ndestinatie);
    }
    BFS(s);
    for (int i=1; i<=n; ++i){
        if (i==s){
            fout << 0 << ' ' ;
        }
        else if(lungime[i]==0){
            fout << -1 << ' ';
        }
        else
        fout << lungime[i] << ' ';
    }
    return 0;
}