#include "bits/stdc++.h"

using namespace std;

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

using ll = long long;
using ull = unsigned long long;

const char nl = '\n';

void bfs(int s, vector<int> &dist, vector<vector<int>> &adj) {
    int n = adj.size();
    vector<bool> been(n);
    queue<int> Q;
    Q.push(s);
    been[s] = true;
    dist[s] = 0;

    while (!Q.empty()) {
        int nod = Q.front();
        Q.pop();
        for (int u : adj[nod]) {
            if (been[u]) continue;
            been[u] = false;
            dist[u] = dist[nod] + 1;
            Q.push(u);
        }
    }
}

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

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n, m, s;
    fin >> n >> m >> s;
    vector<vector<int>> adj(n + 1);
    for (int i = 0; i < m; ++i) {
        int x, y;
        fin >> x >> y;
        adj[x].push_back(y);
    }
    vector<int> distance(n + 1, -1);

    bfs(s, distance, adj);

    for (int i = 1; i <= n; ++i) {
        fout << distance[i] << ' ';
    }
    fout << nl;
    return 0;
}