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

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

const int maxn = 1e5 + 5;
vector <int> G[maxn];
bitset <maxn> Vis;
int Dist[maxn];
int n, m;

void Bfs(int start) {
    queue <int> Q;
    for (int i = 1; i <= n; i++) {
        Dist[i] = -1;
    }
    Dist[start] = 0;
    Vis[start] = true;
    Q.push(start);
    while (!Q.empty()) {
        int node = Q.front();
        Q.pop();
        for (auto &it : G[node]) {
            if (Vis[it] == false) {
                Vis[it] = true;
                Dist[it] = Dist[node] + 1;
                Q.push(it);
            }
        }
    }
}

int main() {
    ios_base :: sync_with_stdio(false);
    int x, y, s;
    fin >> n >> m >> s;
    for (int i = 1; i <= m; i++) {
        fin >> x >> y;
        G[x].push_back(y);
    }
    Bfs(s);
    for (int i = 1; i <= n; i++) {
        fout << Dist[i] << " ";
    }
    return 0;
}