#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");

const int limita=100005;
vector<int>adiacenta[limita];
queue<int>coada;
int distanta[limita];
int n,m;
void bfs()
{
    int nod,vecin;
    while(!coada.empty())
    {
        nod=coada.front();
        coada.pop();
        for(unsigned int i=0; i<adiacenta[nod].size(); i++)
        {
            vecin=adiacenta[nod][i];
            if(distanta[vecin]==-1)
            {
                coada.push(vecin);
                distanta[vecin]=distanta[nod]+1;
            }
        }
    }
}
void citire()
{
    int s;
    fin>>n>>m>>s;
    for(int i=1; i<=m; i++)
    {
        int x,y;
        fin>>x>>y;
        adiacenta[x].push_back(y);
    }
    for(int i=1; i<=n; i++)
        distanta[i]=-1;
    distanta[s]=0;
    coada.push(s);
    bfs();
    for(int i=1; i<=n; i++)
        fout<<distanta[i]<<" ";
}
int main()
{
    citire();

    return 0;
}