#include <fstream>
#include <vector>
#include <bitset>
#include <climits>
#include <algorithm>
#include <queue>

#define INfile "bfs.in"
#define OUTfile "bfs.out"
#define LMax 100001

using namespace std;

ifstream fin(INfile);
ofstream fout(OUTfile);

vector <int>v[LMax];
queue <int> q;
int Values[LMax];
int x, y, n, m, p;

void BFS(int NODE) {
    q.push(NODE);
    while (!q.empty()) {
        x = q.front();
        q.pop();
        int lim = v[x].size();
        for (int i = 0; i < lim; ++i) {
            if (Values[x] + 1 < Values[v[x][i]] || Values[v[x][i]] == -1) {
                q.push(v[x][i]);
                Values[v[x][i]] = Values[x] + 1;
            }
        }
    }
}

int main() {
    fin >> n >> m >> p;
    fill(Values + 1, Values + n + 1, -1);
    Values[p] = 0;
    for (int i = 1; i <= m; ++i)
        fin >> x >> y, v[x].push_back(y);
    BFS(p);
    for (int i = 1; i <= n; ++i)
        fout << Values[i] << ' ';
    return 0;
}