#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>
#include <cstring>

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

const int DIM = 100005;

int n,m,start,Dist[DIM],x,y;

vector <int> G[DIM];

void Read()
{
    fin>>n>>m>>start;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y;
        G[x].push_back(y);
    }
}

queue <int> Q;

void BFS(int nod)
{
    Dist[nod]=1;
    Q.push(nod);
    while(!Q.empty())
    {
        int k=Q.front();
        vector <int> ::iterator it;
        for(it=G[k].begin();it!=G[k].end();it++)
        {
            if(!Dist[*it])
            {
                Dist[*it]=Dist[k]+1;
                Q.push(*it);
            }
        }
        Q.pop();
    }
}

void Print()
{
    for(int i=1;i<=n;i++)
    {
        if(!Dist[i])
            fout<<-1<<" ";
        else
            fout<<Dist[i]-1<<" ";
    }
    fout<<'\n';
}

int main()
{
    Read();
    BFS(start);
    Print();
}