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

#define NMAX 100005

vector<int> G[NMAX];

int main() {
    int n, m, s, d[NMAX] {}, x, y, nod, i;
    queue<int> q;
    ifstream fin("bfs.in");
    ofstream fout("bfs.out");
    fin >> n >> m >> s;
    for(i = 1; i <= m; ++i) {
        fin >> x >> y;
        G[x].push_back(y);
    }
    for(i = 1; i <= n; ++i)
        d[i] = -1;
    d[s] = 0;
    q.push(s);
    while(!q.empty()) {
        nod = q.front();
        q.pop();
        for(int vecin : G[nod])
            if(d[vecin] == -1) {
                d[vecin] = d[nod] + 1;
                q.push(vecin);
            }
    }
    for(i = 1; i <= n; ++i)
        fout << d[i] << ' ';
}