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

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

void bfs(){
    while(!Q.empty()){
        int x=Q.front();
        for(auto &v:graph[x]){
            if(L[v]==0){
                Q.push(v);
                L[v]=L[x]+1;
            }
        }
        Q.pop();
    }
}
int main()
{
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);

    scanf("%d %d %d", &n, &m, &s);
    for(int i=1; i<=m; i++){
        scanf("%d %d", &x, &y);
        graph[x].push_back(y);
    }
    Q.push(s);
    L[s]=1;
    bfs();
    for(int i=1; i<=n; i++)
        printf("%d ", L[i]-1);
    return 0;
}