#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");

int m, n, source, inf = 1000000;
vector<vector<int>> adj;
vector<int> dist;
vector<int> viz;

void BFS(int nod)
{
    queue<int> q;
    dist[source] = 0;
    q.push(source);

    while (!q.empty())
    {
        int nod = q.front();
        q.pop();
        for (int i : adj[nod])
        {
            if (dist[i] > dist[nod] + 1)
            {
                dist[i] = dist[nod] + 1;
                q.push(i);
            }
        }
    }
    for (int i = 1; i <= n; i++)
    {
        if (dist[i] == inf)
        {
            fout << "-1 ";
        }
        else
            fout << dist[i] << " ";
    }
}

int main()
{
    fin >> n >> m >> source;

    adj.resize(n + 5);
    dist.resize(n + 5, inf);
    viz.resize(n + 5);

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

    BFS(source);

    return 0;
}