#include<cstdio>
#include<deque>
#include<vector>
using namespace std;
vector<int> a[100002];
vector<int>::iterator it;
deque<int> cd;
int i, n, m, s, grad[100002], 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<=n;i++) grad[i]=999999999; grad[s]=0;
    for (i=1;i<=m;i++) {
        scanf("%d%d", &x, &y); a[x].push_back(y);
    }
    cd.push_back(s);
    while (!cd.empty()) {
        x=cd.front(); cd.pop_front();
        for (it=a[x].begin();it!=a[x].end();it++) if (grad[*it]>grad[x]+1) {
            grad[*it]=grad[x]+1;
            cd.push_back(*it);
        }
    }
    for (i=1;i<=n;i++) if (grad[i]==999999999) printf("-1 "); else printf("%d ", grad[i]);
    printf("\n"); return 0;
}