#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

int n, m, s, x, y;
vector<int> G[100005];
int d[100005];
queue<int> Q;

void bfs() {
    int nod, vecin;
    while(!Q.empty()) {
        nod = Q.front();
        Q.pop();
        for(unsigned int i = 0; i < G[nod].size(); i++) {
            vecin = G[nod][i];
            if(d[vecin] == -1) {
                Q.push(vecin);
                d[vecin] = d[nod] + 1;
            }
        }
    }
}

int main() {
    fin >> n >> m >> s;
    for(int i = 1; i <= m; i++) {
        fin >> x >> y;
        G[x].push_back(y);
    }
    fin.close();
    for(int i = 1; i <= n; i++) {
        d[i] = -1;
    }
    d[s] = 0;
    Q.push(s);
    bfs();
    for(int i = 1; i <= n; i++) {
        fout << d[i] << " ";
    }
    fout.close();
    return 0;
}