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

vector <int> G[100001];
int f[100001];
void dfs(int x, int d)
{
    f[x] = d;
    for(int i = 0; i < G[x].size(); i++)
        if(f[ G[x][i] ] == -1)
            dfs(G[x][i], d + 1);
}
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;
    dfs(s, 0);
    for(i = 1; i <= n; i++)
        printf("%d ", f[i]);

    return 0;
}