#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> pii;
#define fi first 
#define se second
#define pb push_back

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

const int N = 5e4+5;

int n, s;
vector<int> e[N];
vector<int> r;

void read();
void bfs();

int main()
{
    read();
    bfs();
    for (int i = 1; i <= n; i++) g << r[i] << ' ';

    return 0;
}

void read()
{
    int m;
    f >> n >> m >> s;
    while (m--){
        int a, b; f >> a >> b;
        e[a].pb(b); 
    }
    r.resize(n + 5, -1);
}
void bfs(){
    queue<pii> q; q.push({s, 0}); r[s] = 0;
    while (!q.empty()){
        int nod, dist; tie(nod, dist) = q.front(); q.pop();
        for (auto it: e[nod]){
            if (r[it] != -1) continue;
            r[it] = dist + 1; q.push({it, r[it]});
        }
    }
}