#include <iostream>
#include <fstream>
#include <list>
#include <queue>

#define NMAX 100010

using namespace std;

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

int n, m, s;
list<int> list_ad[NMAX];
queue<int> bfq;
int viz[NMAX];

int main()
{
    fin >> n >> m >> s;
    int x, y;

    for (int i = 0; i < m; ++i)
    {
        fin >> x >> y;

        list_ad[x].push_back(y);
    }

    bfq.push(s);
    viz[s] = 1;

    while (!bfq.empty())
    {
        int nod = bfq.front();
        bfq.pop();

        for (list<int>::iterator it = list_ad[nod].begin();
                it != list_ad[nod].end();
                ++it)
        {
            if (viz[*it] == 0)
            {
                viz[*it] = viz[nod] + 1;
                bfq.push(*it);
            }
        }
    }

    for (int i = 1; i <= n; fout << viz[i++] - 1 << " ");

    return 0;
}