#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
using namespace std;

queue <int > q;
int s,n,m;
int viz[100005];
vector <int > g[100005];
void citire()
{
    scanf("%d%d%d",&n,&m,&s);
    for (int i=1;i<=m;++i)
    {
        int x,y;
        scanf("%d%d",&x,&y);
        g[x].push_back(y);
    }
    q.push(s);
    memset(viz,inf,sizeof(viz));
    viz[s]=0;
}
void bfs()
{
    while (!q.empty())
    {
        int nod=q.front();
        q.pop();
        for (vector <int > :: iterator it=g[nod].begin();it!=g[nod].end();++it)
            if (viz[*it]==inf)
        {
            viz[*it]=viz[nod]+1;
            q.push(*it);
        }
    }
}
void afisare()
{
    for (int i=1;i<=n;++i)
        if (viz[i]==inf)
            printf("-1 ");
        else
            printf("%d ",viz[i]);
}
int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    citire();
    bfs();
    afisare();
    return 0;
}