#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define MOD 1000000007

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef double ld;

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

int n, m;
vi G[100010];
int visited[100010];
int dist[100010];

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

    int source;
    fin >> n >> m >> source;
    for (int i = 0; i < m; i++) {
        int x, y;
        fin >> x >> y;
        G[x].push_back(y);
    }

    queue<ii> q;
    q.push(make_pair(source, 0));
    visited[source] = 1;
    dist[source] = 0;
    while (!q.empty()) {
        int node = q.front().first;
        int d = q.front().second;
        q.pop();
        for (auto &it : G[node]) {
            if (!visited[it]) {
                visited[it] = 1;
                dist[it] = d + 1;
                q.push(make_pair(it, d + 1));
            }
        }
    }
    
    for (int i = 1; i <= n; i++) {
        if (dist[i] == 0 && i != source) {
            dist[i] = -1;
        }
        fout << dist[i] << " ";
    }

    return 0;
}