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

using namespace std;

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

const int MAXN = 100000;
vector <int> adj[MAXN + 1];
vector <int> vis(MAXN + 1, -1);
queue <int> q;

void bfs (int startNode)
{
    q.push(startNode);
    vis[startNode] = 0;

    while (!q.empty())
    {
        int currNode = q.front();
        q.pop();

        for (int nbh: adj[currNode])
            if (vis[nbh] == -1)
            {
                 q.push(nbh);
                 vis[nbh] = vis[currNode] + 1;
            }
    }
}

int main()
{
    int N, M, S;
    in >> N >> M >> S;

    int x, y;
    for (int i = 0; i < M; ++i)
    {
        in >> x >> y;
        adj[x].push_back(y);
    }

    bfs (S);

    for (int i = 1; i <= N; ++i)
        out << vis[i] << " ";

    return 0;
}