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

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

#define NMAX 100005

vector<int> v[NMAX];

int n, m, s;
int dist[NMAX];
queue<int> Q;

void bfs(int nod)
{
    for (int i = 1; i <= n; ++ i)
        dist[i] = -1;

    dist[nod] = 0;
    Q.push(nod);

    while (!Q.empty())
    {
        int aux = Q.front();
        Q.pop();

        for (auto it : v[aux])
            if (dist[it] == -1)
            {
                Q.push(it);
                dist[it] = dist[aux] + 1;
            }
    }
}

int main()
{
    fin >> n >> m >> s;

    for (int i = 1; i <= m; ++ i)
    {
        int x, y;
        fin >> x >> y;
        v[x].push_back(y);
    }

    bfs(s);

    for (int i = 1; i <= n; ++ i)
        fout << dist[i] << ' ';
    return 0;
}