#include<string.h>
#include<queue>
#include<stdio.h>
#include<vector>
using namespace std;
int n,s,m;


vector<int> T[100001];
vector<int> viz;

void citire()
{
    int i,x,y;
    scanf("%d %d %d",&n,&m,&s);
    for(int i=1;i<m+1;i++){
        scanf("%d %d",&x,&y);
        T[x].push_back(y);
       // T[y].push_back(x);
                          }
}
void bfs()
{   int i;
    for(i=1;i<n+2;i++) viz.push_back(-1);
    int z;
    queue<int> q;
    q.push(s);
    viz[s]=0;
    while(!q.empty())
    {
        z=q.front();q.pop();
        for(vector<int>::iterator it=T[z].begin();it!=T[z].end();it++)
            if(viz[*it]==-1)
            {
                viz[*it]=viz[z]+1;
                q.push(*it);
            }
    }
}

void afisare()
{
    for(vector<int>::iterator it=viz.begin()+1;it!=viz.end();it++)
        printf("%d ",*it);
}

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