#include <fstream>
#include <cstring>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n, m, s, x, y, nr, fr[100010];
vector < int > V[100010];
queue < int > Q;

int main()
{
    fin >> n >> m >> s;
    for (int i=1; i<=m; i++)
    {
        fin >> x >> y;
        V[x].push_back(y);
    }

    memset(fr, -1, sizeof(fr));
    fr[s] = 0;

    Q.push(s);
    while (!Q.empty())
    {
        int nod = Q.front();
        Q.pop();
        for (int i=0; i<V[nod].size(); i++)
        {
            if (fr[V[nod][i]] == -1)
            {
                fr[V[nod][i]] = fr[nod] + 1;
                Q.push(V[nod][i]);
            }
        }
    }

    for (int i=1; i<=n; i++)
        fout << fr[i] << ' ';

    fout << '\n';
    fout.close();
    return 0;
}