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

using namespace std;

const int Nmax=100005;

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

class Graf {
    int nrNoduri, nrMuchii;
    int Start;

public:

    Graf(){
        nrNoduri = 0;
        nrMuchii = 0;
        Start = 0;
    };

    void BFS();
};

void Graf::BFS()
{
    in>>nrNoduri>>nrMuchii>>Start;
    queue<int> coada;
    bool vizitat[nrNoduri+1];
    int inaltime[nrNoduri+1];
    vector<int> vecini[nrNoduri+1];
    for(int i=1; i<=nrNoduri+1; i++)
    {
        vizitat[i] = false;
        inaltime[i] = 0;
    }
    for(int i=0; i<nrMuchii; i++)
    {
        int x,y;
        in>>x>>y;
        vecini[x].push_back(y);
    }
    coada.push(Start);
    vizitat[Start] = true;
    while(!coada.empty())
    {
        int nod_curent = coada.front();
        coada.pop();
        int l = vecini[nod_curent].size();
        for(int i=0; i<l; i++)
        {
            int x = vecini[nod_curent][i];
            if(!vizitat[x])
            {
                vizitat[x] = true;
                coada.push(x);
                inaltime[x] = inaltime[nod_curent] + 1;
            }
        }
    }
    for(int i=1; i<=nrNoduri; i++)
    {
        if(inaltime[i] == 0 && i != Start)
            out << -1 <<' ';
        else
            out<<inaltime[i]<<' ';
    }
}

int main()
{
    Graf G;
    G.BFS();
    in.close();
    out.close();
    return 0;
}