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

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

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

int main() {

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

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

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

    fout.close();
    return 0;
}