#include <cstdio>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;
queue<int>q;
vector<int>g[100005];
int n,sel[100005],lg[100005],m,s;
void bf(int x){
sel[x]=true;
q.push(x);
while(!q.empty()){
    int nod=q.front();
    for(auto it : g[nod])
    if(!sel[it]){
        q.push(it);
        sel[it]=true;
        lg[it]=lg[nod]+1;
    }
    q.pop();
}
}
int i,x,y;
int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    scanf("%d %d %d",&n,&m,&s);
    for(i=1;i<=m;i++){
        scanf("%d %d",&x,&y);
        g[x].push_back(y);
    }
    bf(s);
    for(i=1;i<=n;i++){
        if(i!=s && lg[i]!=0)printf("%d ",lg[i]);
        else if(i==s)printf("0 ");
        else printf("-1 ");
    }


    return 0;
}