//ALEX ENACHE

#include <vector>
#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>

using namespace std;

//#include <iostream>
#include <fstream>
ifstream cin ("bfs.in");ofstream cout ("bfs.out");

vector < int > gr[100100];
queue < int > q;
bool used[100100];
int lv[100100];

int main() {

    //freopen("input", "r", stdin);freopen("output", "w", stdout);

    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cout << setprecision(10) << fixed;
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    srand(time(NULL));

    //citesc datele
    int noduri , muchii , sursa;
    cin>>noduri>>muchii>>sursa;

    //citesc muchiile
    for (int i=1; i<=muchii; i++){
        int x , y;
        cin>>x>>y;
        //trag muchie
        gr[x].push_back(y);
    }

    q.push(sursa);
    used[sursa] = true;

    //cat timp nu e goala coada
    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;
            }
        }
    }

    //afisare nivel
    for (int i=1; i<=noduri; i++){
        if (!used[i]){
            lv[i] = -1;
        }
        cout<<lv[i]<<" ";
    }


    return 0;
}