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

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

const int NLIM = 1000001;
int n, m, nodStart;
vector<int> Muchii[NLIM];
int Distanta[NLIM];

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;
            }
        }
    }
}

int main()
{
    cin >> n >> m >> nodStart;
    for (int i = 1; i <= m; ++i)
    {
        int x, y;
        cin >> 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)
        cout << Distanta[i] << " ";

    cin.close();
    cout.close();
    system("PAUSE");
    return 0;
}