#include <iostream>
#include <stdio.h>
#include <vector>
#include <queue>

using namespace std;

int m,n,s;
vector <int> g[100010];
queue <int> q;
int viz[100010];
int sol[100010];

void citire()
{
    freopen("bfs.in","r",stdin);
    scanf("%d %d %d",&n,&m,&s);
    for(int i=0;i<m;i++)
    {
        int x,y;
        scanf("%d %d",&x,&y);
        g[x].push_back(y);
    }
}

void bfs()
{
    q.push(s);
    int l=0;
    viz[s]=1;
    while(!q.empty())
    {
        int t=q.front();
        q.pop();
        for(int i=0;i<g[t].size();i++)
            if(!viz[g[t][i]])
            {
                sol[g[t][i]]=sol[t]+1;
                viz[g[t][i]]=1;
                q.push(g[t][i]);

            }

    }

}


int main()
{
    citire();
    bfs();
    freopen("bfs.out","w",stdout);
    for(int i=1;i<=n;i++)
    {
        if(sol[i]==0 && i==s)
            printf("0 ");
        else if(sol[i]==0)
            printf("-1 ");
        else
            printf("%d ",sol[i]);
    }
    return 0;
}