#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
int n,m,s,i,x,y,d[100005],crt,node;
vector <int> G[100005];
queue <int> Q;
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++) d[i]=-1;
    d[s]=0;
    Q.push(s);
    while (!Q.empty())
    {
        crt=Q.front();
        Q.pop();
        for (i=0; i<G[crt].size(); i++)
        {
            node=G[crt][i];
            if (d[node]==-1)
            {
                d[node]=d[crt]+1;
                Q.push(node);
            }
        }
    }
    for (i=1; i<=n; i++) printf("%d ",d[i]);
    return 0;
}