#include <bits/stdc++.h>
using namespace std;
ifstream fin ("bfs.in");
ofstream fout ("bfs.out");

int n, m, s;
vector <int> g[200001];
int dist[100001];

void bfs(int start)
{
    queue <int> q;
    dist[start] = 0;
    q.push(start);

    while (!q.empty())
    {
        int nod = q.front();
        q.pop();
        for (int vecin : g[nod])
            if (!dist[vecin] && vecin != start)
            {
                dist[vecin] = dist[nod] + 1;
                q.push(vecin);
            }
    }
}

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