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

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

using namespace std;

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

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

void BFS(int NODE) {
    int lim = v[NODE].size();
    for (int i = 0; i < lim;  ++i) {
        int urm = v[NODE][i];
        if (Values[NODE] + 1 < Values[urm] || Values[urm] == -1)
            Values[urm] = Values[NODE] + 1, BFS(urm);
    }
}

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;
}