#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#define nmax 100005
using namespace std;

vector <int> v[nmax];
int cost[nmax];
queue <int> c;
int n, m, s, a, b, nod;

void bfs() {
    cost[s] = 0;
    c.push(s);

    while(!c.empty()) {
        nod = c.front();
        c.pop();

        for(int i=0; i<v[nod].size(); i++) {
            if(cost[ v[nod][i] ] == -1) {
                c.push(v[nod][i]);
                cost[v[nod][i]] = cost[nod] + 1;
            }
        }
    }

}




int main() {
    ifstream f("bfs.in");
    ofstream g("bfs.out");

    f>>n>>m>>s;

    for(int i=1; i<=m; i++) {
        f>>a>>b;
        v[a].push_back(b);
    }
    for(int i=0; i<=n; i++) cost[i] = -1;

    bfs();

    for(int i=1; i<=n; i++) g<<cost[i]<<" ";
    g<<"\n";

    f.close();
    g.close();
    return 0;
}