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

#define N 100001

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

vector<int> a[N];
int d[N], viz[N];
queue<pair<int, int>> q;

void bfs(int start){
    q.push({start, 0});
    viz[start] = 1;
    while(q.empty() == false){
        int nod = q.front().first;
        int val = q.front().second;
        q.pop();

        viz[nod] = 1;
        d[nod] = val;

        for(int k : a[nod])
            if(viz[k] == 0)
                q.push({k, val+1});
    }
}

int main(){
    int n, m, k;
    in >> n >> m >> k;
    for(int i=1; i<=m; i++){
        int x, y;
        in >> x >> y;
        a[x].push_back(y);
    }



    for(int i=1; i<=n; i++)
        d[i] = -1;

    bfs(k);

    for(int i=1; i<=n; i++)
        out << d[i] << ' ';
}