#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
#define MAX 100001

vector<int>g[MAX];

int n,s,d[MAX],c[MAX];
bool was[MAX];

void bfs(){
    int p,u,x,y;
    c[p = u = 1] = s; // introducem in coada nodul sursa
    was[s] = 1; // nodul respectiv a fost vizitat
    while(p <= u)
    {
        x = c[p++]; // extragem un nod din coada
        for(int i=0;i<g[x].size();i++)
        {
            y = g[x][i]; // extragem un vecin
            if(!was[y])
            {
                d[y] = d[x] + 1; // actualizam distanta
                was[y] = 1; // marcam ca fiind parcurs deja
                c[++u] = y; // introducem nodul in coada
            }
        }
    }
}

int main(){
    int m,x,y;
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
        scanf("%d %d %d",&n,&m,&s);
        while(m--)
        {
            scanf("%d %d",&x,&y);
            g[x].push_back(y);
        }
    bfs();
    for(int i=1;i<=n;i++)printf("%d ",d[i] == 0 && i==s ? 0 : d[i] == 0 ? -1 : d[i]);
    return 0;
}