#include <fstream>
#include <vector>
#include <climits>
#include <queue>

using namespace std;
const int NMAX = 100000;
vector<int> graf[1 + NMAX];
int distMin[1 + NMAX];
queue<pair<int, int>> q;

int main()
{
    ifstream in("bfs.in");
    ofstream out("bfs.out");

    int n, m, s;
    in >> n >> m >> s;
    for (int j = 1; j <= m; j++)
    {
        int x, y;
        in >> x >> y;
        graf[x].push_back(y);
    }
    for (int i = 1; i <= n; i++)
            distMin[i] = INT_MAX;

    distMin[s] = 0;
    q.push(make_pair(s, 0));

    while (!q.empty())
    {
        int nod = q.front().first;
        int dist = q.front().second;
        q.pop();
        for (int i = 0; i < graf[nod].size(); i++)
        {
            int vecin = graf[nod][i];

            if (distMin[vecin] > dist + 1)
            {
                distMin[vecin] = dist + 1;
                q.push(make_pair(vecin, distMin[vecin]));
            }
        }
    }

    for (int i = 1; i <= n; i++)
    {
        if (distMin[i] != INT_MAX)
            out << distMin[i] << ' ';
        else
            out << -1 << ' ';
    }
    out << '\n';

    return 0;
}