#include<cstdio>
#include<algorithm>
#include<queue>
#include<vector>
#include<cstring>
using namespace std;
queue < int >q;
vector <int > v[100005];
int viz[100005];
int n,i,j,m,s;
void citire()
{
    int x,y;
    scanf("%d %d %d",&n,&m,&s);
    for (i=1;i<=m;i++)
    {
        scanf("%d %d",&x,&y);
        v[x].push_back(y);
        //v[y].push_back(x);
    }
}
void rez()
{
    memset(viz,-1,sizeof(viz));
    viz[s]=0; q.push(s);
    while (!q.empty())
    {
        i=q.front();
        q.pop();
        for (j=0;j<v[i].size();j++) if (viz[v[i][j]]==-1)
        viz[v[i][j]]=viz[i]+1,q.push(v[i][j]);
    }
}
int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    citire();
    rez();
    for (i=1;i<=n;i++) printf("%d ",viz[i]);
    return 0;
}