#include <bits/stdc++.h>

using namespace std;

const int N = 100000;
queue <int> q;
vector <int> v[N+5];
int dist[N+5];
int main() {
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    int n,m,s,i,x,y;
    scanf("%d%d%d",&n,&m,&s);
    for(i=1; i<=m; i++) {
        scanf("%d%d",&x,&y);
        v[x].push_back(y);
    }
    for(i=1; i<=n; i++) dist[i] = -1;
    dist[s] = 0;
    q.push(s);
    while(!q.empty()) {
        x = q.front();
        for(i=0; i<v[x].size(); i++) {
            y = v[x][i];
            if(dist[y] == -1) {
                q.push(y);
                dist[y] = dist[x] + 1;
            }
        }
        q.pop();
    }
    for(i=1;i<=n;i++){
        printf("%d ",dist[i]);
    }
    return 0;
}