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

#define P 1999999973
using namespace std;

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

int viz[100005], n, m, s, d[100005];
vector<int>L[100005];

void Bfs(int nod)
{
    queue<int>q;
    q.push(nod);
    viz[nod] = 1;
    for (int i = 1; i <= n; i++)
        d[i] = 2e9;
    d[nod] = 0;
    while (!q.empty())
    {
        nod = q.front();
        q.pop();
        for (auto i : L[nod])
            if (!viz[i] && d[i] > d[nod] + 1)
            {
                d[i] = d[nod] + 1;
                q.push(i);
                viz[i] = 1;
            }
    }
}

int main()
{
    int x, y;
    fin >> n >> m >> s;
    for (int i = 1; i <= m; i++)
    {
        fin >> x >> y;
        L[x].push_back(y);
    }
    Bfs(s);
    for (int i = 1; i <= n; i++)
        if (d[i] == 2e9 && i != s)
            fout << "-1 ";
        else
            fout << d[i] << " ";
    return 0;
}