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

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

queue<int> q;
vector<int> v[100001];
int viz[100001];
int n, m, x, i, j;

void bfs(int start){
    int k;
    q.push(start);
    viz[start] = 0;
    while (!q.empty()){
        k = q.front();
        for(auto j: v[k]) {
            if (viz[j] == -1) {
                viz[j] = viz[k] + 1;
                q.push(j);
            }
        }
        q.pop();
    }
}

int main(){
    in >> n >> m >> x;
    for(int i = 0; i <= n; ++i)
        viz[i] = -1;
    while(m--){
        in >> i >> j;
        v[i].push_back(j);
    }

    bfs(x);
    for(int i = 1; i<=n; ++i)
        out << viz[i] << ' ';
    return 0;
}