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

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

const int MAXN = 100005;
int n, m, d;
vector<int> v[MAXN];
int c[MAXN];
queue<int> q;

int main() {

    fin >> n >> m >> d;
    for (int i = 1; i <= m; ++i) {
        int a, b;
        fin >> a >> b;
        v[a].push_back(b);
    }

    c[d] = 1;
    q.push(d);
    while (!q.empty()) {
        int k = q.front();
        for (int j = 0; j < v[k].size(); ++j) {
            if (c[v[k][j]] == 0) {
                c[v[k][j]] = c[k] + 1;
                q.push(v[k][j]);
            }
        }
        q.pop();
    }

    for (int i = 1; i <= n; ++i) {
        fout << c[i] - 1 << ' ';
    }

    fout.close();
    return 0;
}