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

using namespace std;

const int Nmax = 100000;
int dist[Nmax + 1];
vector <int> adj[Nmax + 1];
bool visited[Nmax + 1];
queue <int> q;

int main()
{
    ifstream fin("bfs.in");
    ofstream fout("bfs.out");
    int n, m, s;
    fin >> n >> m >> s;
    for (int i = 1; i <= m; i++)
    {
        int u, v;
        fin >> u >> v;
        adj[u].push_back(v);
    }
    visited[s] = true;
    dist[s] = 0;
    q.push(s);
    while (!q.empty())
    {
        int s = q.front();
        q.pop();
        for (auto u : adj[s])
        {
            if (visited[u])
            {
                continue;
            }
            visited[u] = true;
            dist[u] = dist[s] + 1;
            q.push(u);
        }
    }
    for (int i = 1; i <= n; i++)
    {
        if (dist[i] == 0 && i != s)
        {
            fout << "-1 ";
        }
        else
        {
            fout << dist[i] << " ";
        }
    }
    return 0;
}