#include <cstdio>
#include <vector>
#include <queue>
#include <map>
#include <algorithm>
using namespace std;
int N,M,S;
map<int,vector<int> >graf;
void bfs()
{
    queue<int>q;
    int *a=new int[N+1];
    fill(a,a+N+1,100011);
    q.push(S);
    a[S]=0;
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(int i=0;i<graf[nod].size();i++)
        {
            if(a[graf[nod][i]]>a[nod]+1)
            {
                a[graf[nod][i]]=a[nod]+1;
                q.push(graf[nod][i]);
            }
        }
    }
    for(int i=1;i<=N;i++)
        if(a[i]==100011)
            printf("%d ",-1);
        else
        printf("%d ",a[i]);
}
int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    scanf("%d %d %d",&N,&M,&S);
    for(int i=1;i<=M;i++)
    {
        int from,to;
        scanf("%d %d",&from,&to);
        graf[from].push_back(to);
    }
    bfs();
    return 0;
}