#include <bits/stdc++.h>
using namespace std;

vector<int> g[100001];
int n, m, S;
int viz[100001], d[100001];
/// d[i] = distanta minima de la S la i
ifstream fin("bfs.in");
ofstream fout("bfs.out");

void Citire()
{
    int i, j;
    fin >> n >> m >> S;
    for (int p = 1; p <= m; p++)
    {
        fin >> i >> j;
        g[i].push_back(j);
    }
}

void BFS(int k)
{
    queue<int> q;
    q.push(k);
    viz[k] = 1;
    d[k] = 0;
    while (!q.empty())
    {
        k = q.front();
        q.pop();
        for (int i : g[k])
            if (!viz[i])
            {
                d[i] = 1 + d[k];
                q.push(i);
                viz[i] = 1;
            }
    }
}

void DFS(int k)
{
    viz[k] = 1;
    for (int i : g[k])
        if (!viz[i]) DFS(i);
}

void Afisare()
{
    for (int i = 1; i <= n; i++)
        if (!viz[i]) fout << "-1 ";
        else fout << d[i] << " ";
}

int main()
{
    Citire();
    BFS(S);
    Afisare();
    return 0;
}