#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

vector <int> a[100005];
int C[100005];

int n, m, s;

inline void BFS(int nod, int v)
{
    C[nod] = v;
    int l = a[nod].size();
    for (int i = 0; i < l; i++)
        if (C[a[nod][i]] == -1 || C[a[nod][i]] > v + 1)
            BFS(a[nod][i], v + 1);
}

int main()
{
    int i, x, y;
    fin >> n >> m >> s;
    for (i = 1; i <= m; i++)
    {
        fin >> x >> y;
        a[x].push_back(y);
    }
    for (int i = 1; i <= n; i++)
        C[i] = -1;
    BFS(s, 0);
    for (i = 1; i <= n; i++)
        fout << C[i] << " ";
    return 0;
}