#include <bits/stdc++.h>
using namespace std;
queue <int> q;
int n,m,s,d[100005],u,v;

int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    scanf("%d%d%d",&n,&m,&s);
    vector<vector<int> > adj(n+1);
    for (int i = 1; i<=n; ++i)
    {
        d[i] = -1;
    }
    for (int i = 0; i<m; ++i)
    {
        scanf("%d%d",&u,&v);
        adj[u].push_back(v);
    }
    q.push(s); d[s] = 0;
    while (!q.empty())
    {
        u = q.front(); q.pop();
        for (int i = 0; i<(int)adj[u].size(); ++i)
        {
            int k = adj[u][i];
            if (d[k] == -1)
            {
                d[k] = d[u] + 1;
                q.push(k);
            }
        }
    }
    for (int i = 1; i<=n; ++i)
    {
        printf("%d ",d[i]);
    }
}