#include<bits/stdc++.h>
using namespace std;
#define in f
#define out g

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

queue <int> q;
vector <int> v[1000000];
int n;
int depth[1000000];
int s;
int viz[100000];
int node;
int m;
int x;
int y;


int main() {

    in >> n;
    in >> m;
    in >> s;
    for(int i = 1; i <= m; i++) {
        in >> x;
        in >> y;
        v[x].push_back(y);
    }
    q.push(s);
    viz[s] = 1;
    while(q.empty() == false) {
        node = q.front();
        q.pop();
        for(int i = 0; i < v[node].size(); i++) {
            if(viz[v[node][i]] == 0) {
                q.push(v[node][i]);
                depth[v[node][i]] = depth[node] + 1;
                viz[v[node][i]]++;
            }
        }
    }
    for(int i = 1; i <= n; i++) {
        if(viz[i] == 0) {
            out << "-1 ";
        } else {
            out << depth[i] << " ";
        }
    }
}