#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>

using namespace std;

const int N=100005;

vector <int> G[N];
int d[N];
queue <int> Q;

int main()
{
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);
    int n, m, S, i, x, y;
    scanf("%d%d%d", &n, &m, &S);
    while(m--)
    {
        scanf("%d%d", &x, &y);
        G[x].push_back(y);
    }
    d[S]=1;
    for(Q.push(S);!Q.empty();Q.pop())
    {
        x=Q.front();
        for(auto p: G[x])
        {
            if(!d[p])
            {
                d[p]=d[x]+1;
                Q.push(p);
            }
        }
    }
    for(i=1;i<=n;i++) printf("%d ", d[i]-1);
}