#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define nMax 100005
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,i,j,dist[nMax];
vector <int>muchii[nMax];
queue<int>coada;

void BFS()
{
    int nod,vecin;
    while(!coada.empty())
    {
        nod=coada.front();
        coada.pop();
        for(unsigned int i=0; i<muchii[nod].size(); i++)
        {
            vecin=muchii[nod][i];
            if(dist[vecin]==-1)
            {
                coada.push(vecin);
                dist[vecin]=dist[nod]+1;
            }
        }
    }
}
void citire()
{
    int nodStart;
    fin>>n>>m>>nodStart;
    for(i=1; i<=m; i++)
    {
        int x,y;
        fin>>x>>y;
        muchii[x].push_back(y);
    }
    for(i=1; i<=n; i++)
        dist[i]=-1;
    dist[nodStart]=0;
    coada.push(nodStart);
    BFS();
    for(i=1; i<=n; i++)
        fout<<dist[i]<<' ';
}
int main()
{
    citire();
    return 0;
}