#include <iostream>
#include <fstream>
#include <cstring>
#include <vector>
#define MAX 100010

using namespace std;

int N, M, Len, Sursa;
vector <int> Ad[MAX];
int Graf[MAX], StartQ[MAX], Cost[MAX]={-1};

void BFS(int nod)
{

    memset(Cost, -1, sizeof(Cost));

    Len = 1;
    Cost[nod] = 0;
    StartQ[Len] = nod;

    for (int i = 1; i <= Len; i++)
        for (int j = 0; j < Graf[StartQ[i]]; j++)
            if (Cost[Ad[StartQ[i]][j]] == -1)
            {
                StartQ[++Len] = Ad[StartQ[i]][j];
                Cost[StartQ[Len]] = Cost[StartQ[i]] + 1;
            }
}

int main()
{
    ifstream in("bfs.in");
    ofstream out("bfs.out");

    int  x, y;

    in>>N>>M>>Sursa;

    for (int i = 1; i <= M; i++)
    {
        in>>x>>y;
        Ad[x].push_back(y);
    }

    for (int i = 1; i <= N; i++)
        Graf[i] = Ad[i].size();

    BFS(Sursa);

    for (int i = 1; i <= N; i++)
        out<<Cost[i]<<" ";
    out<<"\n";

    return 0;
}