#include <bits/stdc++.h>

using namespace std;

const int N=100005;
int d[N];
queue <int> q;
vector <int> G[N];

int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);

    int n,m,s,i,l,x,y;
    scanf("%d%d%d",&n,&m,&s);
    for(i=1;i<=m;i++){
        scanf("%d%d",&x,&y);
        G[x].push_back(y);
    }

    d[s]=1;
    q.push(s);
    while(!q.empty()){
        x=q.front();
        l=G[x].size();
        q.pop();
        for(int i=0;i<l;i++){
            y=G[x][i];
            if(!d[y]){
                d[y]=d[x]+1;
                q.push(y);
            }
        }
    }
    for(i=1;i<=n;i++) printf("%d ",--d[i]);

    return 0;
}