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

vector <int> G[100001];
int f[100001], q[100001];
void bfs(int x)
{
    f[x] = 0;
    int p, u;
    q[p = u = 1] = x;
    while(p <= u)
    {
        x = q[p];
        for(int i = 0; i < G[x].size(); i++)
            if(f[G[x][i]] == -1)
            {
                f[G[x][i]] = f[x] + 1;
                q[++u] = G[x][i];
            }
        p++;
    }
}
int main() {
    int i, n, m, s, x, y;
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);
    scanf("%d%d%d", &n, &m, &s);
    for(i = 1; i <= m; i++)
    {
        scanf("%d%d", &x, &y);
        G[x].push_back(y);
    }
    for(i = 1; i <= n; i++)
        f[i] = -1;
    bfs(s);
    for(i = 1; i <= n; i++)
        printf("%d ", f[i]);

    return 0;
}