#include <stdio.h>
#include <vector>
#include <queue>
#define Nm 100001

using namespace std;

int i,N,M,S,x,y,n,d[Nm];
bool o[Nm];
vector <int> g[Nm];
queue <int> q;

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);
    }
    q.push(S); o[S]=1;
    while(!q.empty())
    {
        for(i=0;i<g[q.front()].size();i++)
        {
            n=g[q.front()][i];
            if(!o[n])
         {q.push(n); o[n]=1; d[n]=d[q.front()]+1;}
        }
        q.pop();
    }
    for(i=1;i<=N;i++) if(d[i]||i==S) printf("%d ",d[i]);
    else printf("%d ",-1);
    return 0;
}