#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
using namespace std;

#define N_MAX 100000

vector<int>graf[N_MAX+1];
int n,m,s;

void citire()
{
    scanf("%d %d %d ",&n,&m,&s);
    for(int i=1;i<=m;i++)
    {
        int nod1,nod2;
        scanf("%d %d ",&nod1,&nod2);
        graf[nod1].push_back(nod2);
    }
}

void bfs()
{
    vector<int>viz(n+1,-1);
    viz[s]=0;
    queue<int>q;
    q.push(s);
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        vector<int>::iterator it,stop=graf[nod].end();
        for(it=graf[nod].begin();it!=stop;it++)
        {
            if(viz[*it]<0)
            {
                q.push(*it);
                viz[*it]=viz[nod]+1;
            }
        }
    }
    for(int i=1;i<=n;i++)
    {
        printf("%d ",viz[i]);
    }
}

int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    citire();
    bfs();
    return 0;
}