#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<vector>
#include<bitset>
#define INF 0x3f3f3f3f
#define mp make_pair
#define pb push_back
#define maxn 100010
using namespace std;
vector < int > G[maxn];
queue < int > q;
int sel[maxn],n,m,S,i,x,y;

int main()
{
    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].pb(y);
    sel[S]=1;
    q.push(S);
    while(!q.empty())
    {
        x=q.front();
        for(i=0; i<G[x].size(); ++i)
            if(!sel[G[x][i]] || sel[G[x][i]] > sel[x]+1)
            {
                sel[G[x][i]] = sel[x]+1;
                q.push(G[x][i]);
            }
        q.pop();
    }
    for(i=1; i<=n; ++i)
        printf("%d ",sel[i] == 0 ? -1 : sel[i]-1);
    return 0;
}