#include <cstdio>
#include <queue>
#include <list>
#define ll long long
using namespace std;

const int maxN = 100003;
list <int> a[maxN];
int ok[maxN];
int main()
{
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);
    int n, m, s, i;
    scanf("%d %d %d", &n, &m, &s);
    while (m--)
    {
        int x, y;
        scanf("%d %d", &x, &y);
        a[x].push_back(y);
    }
    for (i = 1; i <= n; i++)
        ok[i] = -1;
    queue <int> q;
    ok[s] = 0;
    q.push(s);
    while (!q.empty())
    {
        int v = q.front();
        q.pop();
        for (int it : a[v])
            if (ok[it] == -1)
            {
                ok[it] = ok[v] + 1;
                q.push(it);
            }
    }
    for (i = 1; i <= n; i++)
        printf("%d ", ok[i]);
}