#include <vector>
//#include <iostream>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <unordered_map>
#include <time.h>
#include <iomanip>
#include <deque>
#include <math.h>
#include <cmath>
#include <assert.h>
#include <stack>
#include <bitset>
#include <random>
#include <chrono>
#include <fstream>
using namespace std;





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

vector <int> v[100100];
queue <int> q;
bool used[100100];
int lvl[100100];
int main(){
int noduri , muchii , sursa;
    cin>>noduri>>muchii>>sursa;
 for (int i=1; i<=muchii; i++){
        int x , y;
        cin>>x>>y;
        gr[x].push_back(y);}
 q.push(sursa);
    used[sursa] = true;
 while (!q.empty()){
        int nod = q.front();
        q.pop();
        for (int i=0; i<gr[nod].size(); i++){
            if (!used[gr[nod][i]]){
                q.push(gr[nod][i]);
                used[gr[nod][i]] = true;
                lv[gr[nod][i]] = lv[nod] + 1;}}}
for (int i=1; i<=noduri; i++){
        if (!used[i]){
            lv[i] = -1;}
        cout<<lv[i]<<" ";}
return 0;}