#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#define N 1000005
using namespace std;
vector <int> G[N];

queue <int> Q;
int n,m,s,p[N],x,y;
void Lee(int start)
{
    Q.push(start);
    p[start]=1;
    while(!Q.empty())
    {
        vector <int>::iterator it;
        int x=Q.front();
        Q.pop();
        for(it=G[x].begin();it<G[x].end();++it)
        {
            if(p[*it]==0)
            {
                Q.push(*it);
                p[*it]=p[x]+1;
            }
        }

    }
    for(int i=1;i<=n;i++)
    {
        printf("%d ",p[i]-1);
    }
}
void citire()
{
    scanf("%d %d %d\n",&n,&m,&s);
    for(int i=1;i<=m;i++)
    {
        scanf("%d %d\n",&x,&y);
        G[x].push_back(y);
    }
    Lee(s);
}
int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    citire();
   // cout << "Hello world!" << endl;
    return 0;
}