#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

const int NMAX = 100005;

int n, m, nodStart;
int distanta[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(distanta[vecin]==-1)
            {
                coada.push(vecin);
                distanta[vecin]=distanta[nod]+1;
            }
        }
    }
}

void citire()
{
    fin>>n>>m>>nodStart;
    for(int i=1; i<=m; i++)
    {
        int x, y;
        fin>>x>>y;
        muchii[x].push_back(y);
    }

    for(int i=1; i<=n; i++)
        distanta[i]=-1;
    distanta[nodStart]=0;

    coada.push(nodStart);

    BFS();

    for(int i=1; i<=n; i++)
        fout<<distanta[i]<<" ";
}

int main()
{
    citire();
    return 0;
}