#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
int x, y, N, M, i, Sel[100001], Niv[100001], S;
vector<int> G[100001];
inline void BFS()
{
    queue<int> Q;
    vector<int> ::iterator it;
    Q.push(S);
    Sel[S]=1;
    while (!Q.empty())
    {
        x=Q.front();
        for (it=G[x].begin(); it!=G[x].end(); it++)
            if (!Sel[*it])
            {
                Sel[*it]=1;
                Q.push(*it);
                Niv[*it]=Niv[x]+1;
            }
        Q.pop();
    }
}
int main()
{
    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++) Niv[i]=-1;
    Niv[S]=0;
    BFS();
    for (i=1; i<=N; i++) printf("%d ", Niv[i]);
    return 0;
}